\\n {{/if}}\\n \\n\", {\n moduleName: \"core/components/legal-info/layout/index.hbs\"\n});","/* import __COLOCATED_TEMPLATE__ from './index.hbs.js'; */\nimport { buildTask as _buildTask } from \"ember-concurrency/async-arrow-runtime\";\nvar _class, _descriptor, _descriptor2;\nfunction _initializerDefineProperty(e, i, r, l) { r && Object.defineProperty(e, i, { enumerable: r.enumerable, configurable: r.configurable, writable: r.writable, value: r.initializer ? r.initializer.call(l) : void 0 }); }\nfunction _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }\nfunction _toPropertyKey(t) { var i = _toPrimitive(t, \"string\"); return \"symbol\" == typeof i ? i : i + \"\"; }\nfunction _toPrimitive(t, r) { if (\"object\" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || \"default\"); if (\"object\" != typeof i) return i; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (\"string\" === r ? String : Number)(t); }\nfunction _applyDecoratedDescriptor(i, e, r, n, l) { var a = {}; return Object.keys(n).forEach(function (i) { a[i] = n[i]; }), a.enumerable = !!a.enumerable, a.configurable = !!a.configurable, (\"value\" in a || a.initializer) && (a.writable = !0), a = r.slice().reverse().reduce(function (r, n) { return n(i, e, r) || r; }, a), l && void 0 !== a.initializer && (a.value = a.initializer ? a.initializer.call(l) : void 0, a.initializer = void 0), void 0 === a.initializer ? (Object.defineProperty(i, e, a), null) : a; }\nfunction _initializerWarningHelper(r, e) { throw Error(\"Decorating class property failed. Please ensure that transform-class-properties is enabled and runs after the decorators transform.\"); }\nimport { service } from \"@ember/service\";\nimport Component from \"@glimmer/component\";\nimport Medic from \"core/models/medic\";\nimport OncoToulouseInfoMessage from \"core/models/onco-toulouse-info-message\";\nimport Patient from \"core/models/patient\";\nimport SemeiaSessionService from \"core/services/session\";\nimport TermsOfUseService from \"core/services/terms-of-use\";\nimport { Changeset } from \"ember-changeset\";\nimport { task } from \"ember-concurrency\";\nimport styles from \"./index.module.css\";\nlet TermsOfUseComponent = (_class = class TermsOfUseComponent extends Component {\n constructor(...args) {\n super(...args);\n _defineProperty(this, \"styles\", styles);\n _initializerDefineProperty(this, \"termsOfUse\", _descriptor, this);\n _initializerDefineProperty(this, \"session\", _descriptor2, this);\n _defineProperty(this, \"payloadKey\", \"acceptTermsOfUse\");\n _defineProperty(this, \"saveTask\", _buildTask(() => ({\n context: this,\n generator: function* () {\n if (!this.acceptsTermsOfUse) return;\n this.user.set(\"acceptedTermsOfUseVersion\", this.termsOfUse.currentVersion);\n yield this.user.save();\n this.termsOfUse.continueNavigationAfterAcceptingTermsOfUse();\n }\n }), null, \"saveTask\", null));\n }\n get changeset() {\n // Memoization :\n Object.defineProperty(this, \"changeset\", {\n value: Changeset({}),\n writable: false\n });\n return this.changeset;\n }\n get user() {\n return this.session.medic || this.session.patient;\n }\n get acceptsTermsOfUse() {\n return this.changeset.get(this.payloadKey);\n }\n get isButtonDisabled() {\n return !this.acceptsTermsOfUse || this.saveTask.isRunning;\n }\n get shouldAcceptLatestTermsOfUseVersion() {\n return Boolean(this.user) && !this.user.isAcceptedTermsOfUse;\n }\n get alreadyAcceptedAnyTermsOfUse() {\n return this.user.acceptedTermsOfUseVersion;\n }\n get limitDate() {\n return this.termsOfUse.limitDate;\n }\n get shouldShowOncoToulouseSection() {\n return this.session.patient?.healthCentre?.oncoToulouse && Boolean(this.args.oncoToulouseInfoMessage) || false;\n }\n}, _descriptor = _applyDecoratedDescriptor(_class.prototype, \"termsOfUse\", [service], {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: null\n}), _descriptor2 = _applyDecoratedDescriptor(_class.prototype, \"session\", [service], {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: null\n}), _class);\nexport { TermsOfUseComponent as default };","import { precompileTemplate } from \"@ember/template-compilation\";\nexport default precompileTemplate(\"{{page-title \\\"Informations légales\\\"}}\\n\\n\",{ moduleName: \"parog-web/templates/terms-of-use.hbs\" })","import { precompileTemplate } from \"@ember/template-compilation\";\nexport default precompileTemplate(\"\\n Informations l\\xE9gales\\n\\n\\n\\n <:content>\\n
\\n \\n
\\n L\\u2019application internet semeia.app est \\xE9dit\\xE9 par\\xA0:\\n
\\n
\\n La soci\\xE9t\\xE9 S\\xEAmeia, soci\\xE9t\\xE9 par actions simplifi\\xE9e au capital de 6\\n 076,00 euros, enregistr\\xE9e au RCS de PARIS sous le num\\xE9ro 829 055 854,\\n dont le Num\\xE9ro de TVA intracommunautaire est FR 80\\xA0829\\xA0055 854, dont\\n le si\\xE8ge est 174 Quai de Jemmapes 75010 - Paris France, repr\\xE9sent\\xE9e\\n par son pr\\xE9sident, Monsieur Daniel Szeftel.\\n
\\n
\\n La soci\\xE9t\\xE9 S\\xEAmeia SAS peut \\xEAtre jointe\\xA0\\xE0 l\\u2019adresse mail\\n contact@semeia.io\\n
\\n
\\n L\\u2019application internet semeia.app est h\\xE9berg\\xE9e par\\xA0:\\n
\\n
\\n Le directeur de la publication est M. Daniel Szeftel.\\n
\\n
\\n L\\u2019application internet S\\xEAmeia.app est h\\xE9berg\\xE9e \\xE0 Roubaix par la\\n soci\\xE9t\\xE9 OVHcloud, 2 rue Kellermann, 59100 Roubaix, France.\\n
\\n
\\n Les donn\\xE9es de sant\\xE9 \\xE0 caract\\xE8re personnel sont h\\xE9berg\\xE9es en France\\n chez un h\\xE9bergeur agr\\xE9\\xE9\\xA0: OVH, soci\\xE9t\\xE9 par actions simplifi\\xE9es au\\n capital de 10 0679 020 \\u20AC, enregistr\\xE9e au RCS de Lille M\\xE9tropole sous\\n le num\\xE9ro 424 781 419, dont le num\\xE9ro de TVA intercommunautaire est le\\n FR 22 424 781 419, dont le si\\xE8ge social est sis 2 rue Kellermann 59100\\n \\u2013 Paris.\\n
\\n \\n
\\n\\n
\\n \\n Conditions G\\xE9n\\xE9rales d'Utilisation de la solution S\\xEAmeia\\n \\n
\\n\\n
\\n \\n Politique de confidentialit\\xE9\\n \\n
\\n\\n
\\n \\n Politique de Cookies\\n \\n
\\n\\n
\\n \\n \\xC9tiquettes produits\\n \\n
\\n\\n
\\n \\n Manuel utilisateurs\\n \\n
\\n\\n
\\n \\n L'application Pilot v.1, \\xE9dit\\xE9e par la soci\\xE9t\\xE9 S\\xEAmeia, est homologu\\xE9e en\\n date du 23 septembre 2020 en authentification directe pour le profil DMP\\n consultation uniquement.\\n \\n Les fonctions DMP int\\xE9gr\\xE9es sont :\\n
\\n
V\\xE9rification de l'existence d'un dossier DPM pour un patient
\\n
V\\xE9rification et application de l'autorisation d'un m\\xE9decin \\xE0\\n l'acc\\xE8s au DMP d'un patient
\\n
Consultation des documents du DMP d'un patient
\\n
Consultation du contenu d'un document DMP d'un patient
\\n
\\n L'application utilise un outil pour acc\\xE9der au DMP :\\n
\\n
\\n DmpConnect v.3, \\xE9dit\\xE9 par la soci\\xE9t\\xE9 icanop\\xE9e, est homologu\\xE9 en mode\\n EAI en date du 17 avril 2019 en authentification directe et\\n indirecte, pour tous les profils d'acc\\xE8s DMP : Acc\\xE8s s\\xE9curis\\xE9,\\n Cr\\xE9ation et Gestion Administrative, Alimentation et Consultation.\\n
\\n
\\n \\n L'application utilise l'identification \\xE9lectronique par Pro Sant\\xE9\\n Connect.\\n \\n Pro Sant\\xE9 Connect est un t\\xE9l\\xE9service mis en \\u0153uvre par l\\u2019Agence du\\n Num\\xE9rique en Sant\\xE9 (ANS) contribuant \\xE0 simplifier l\\u2019identification\\n \\xE9lectronique des professionnels intervenant en sant\\xE9.\\n \\n L\\u2019utilisateur peut se connecter gr\\xE2ce \\xE0 son application mobile e-CPS ou\\n sa carte CPS, avec un lecteur de cartes et les composants n\\xE9cessaires.\\n \\n
\\n\\n {{#if this.displayArticle51}}\\n
\\n \\n
\\n Madame, Monsieur,\\n
\\n
\\n Vous avez \\xE9t\\xE9 inclus(e) par votre \\xE9quipe soignante dans un programme\\n de t\\xE9l\\xE9surveillance m\\xE9dicale, financ\\xE9 actuellement dans le cadre\\n d\\u2019un programme d\\u2019exp\\xE9rimentations propos\\xE9 par le Minist\\xE8re des\\n solidarit\\xE9s et de la sant\\xE9 et l\\u2019Assurance maladie.\\n
\\n
\\n Ce programme, appel\\xE9\\n \\xAB exp\\xE9rimentation Article 51 \\xAB t\\xE9l\\xE9surveillance des patients\\n transplant\\xE9s \\xBB\\xBB, vise \\xE0 am\\xE9liorer la qualit\\xE9 de vos soins et\\n de votre suivi en d\\xE9veloppant des formes innovantes d\\u2019organisation\\n des soins. Pour les professionnels de sant\\xE9 qui vous suivent, il\\n s\\u2019agit d\\u2019envisager de nouvelles mani\\xE8res de travailler, plus\\n collectives, qui ont pour but d\\u2019am\\xE9liorer la coordination et la\\n continuit\\xE9 des soins. Vous pouvez trouver des informations\\n d\\xE9taill\\xE9es sur ce programme sur le site du Minist\\xE8re des solidarit\\xE9s\\n et de la sant\\xE9 dans la rubrique\\n \\xAB Exp\\xE9rimenter et innover pour mieux soigner \\xBB.\\n
\\n
\\n La loi impose que\\n toutes les \\xAB exp\\xE9rimentations Article 51 \\xBB fassent l\\u2019objet d\\u2019une\\n \\xE9valuation\\n visant \\xE0 appr\\xE9cier leur bon fonctionnement et leurs r\\xE9sultats. Ces\\n \\xE9valuations aideront \\xE0 d\\xE9cider si cette exp\\xE9rimentation doit \\xEAtre ou\\n non \\xE9tendue \\xE0 l\\u2019ensemble du syst\\xE8me de sant\\xE9 fran\\xE7ais. Elles\\n consistent en des travaux d\\u2019\\xE9tudes, d\\u2019enqu\\xEAtes et d\\u2019analyses\\n statistiques.\\n
\\n
\\n Ces \\xE9valuations seront r\\xE9alis\\xE9es par des \\xE9quipes d\\u2019\\xE9valuateurs\\n sp\\xE9cialis\\xE9es missionn\\xE9es par le Minist\\xE8re des solidarit\\xE9s et de la\\n sant\\xE9 et de la Caisse nationale d\\u2019assurance maladie, qui assurent\\n conjointement la responsabilit\\xE9 du traitement des donn\\xE9es. L\\u2019Agence\\n r\\xE9gionale de sant\\xE9 de votre r\\xE9gion est \\xE9galement engag\\xE9e dans le\\n dispositif.\\n Ces \\xE9valuations sont encadr\\xE9es par une autorisation de la\\n Commission nationale de l\\u2019informatique et des libert\\xE9s (CNIL)\\n d\\xE9livr\\xE9e apr\\xE8s l\\u2019appr\\xE9ciation des conditions de s\\xE9curit\\xE9 et de\\n confidentialit\\xE9 dans lesquelles vos donn\\xE9es seront utilis\\xE9es (num\\xE9ro\\n de l\\u2019autorisation 2022-072).\\n
\\n
\\n Les analyses men\\xE9es par les \\xE9valuateurs seront r\\xE9alis\\xE9es sur la base\\n de donn\\xE9es vous concernant,\\n sans utilisation de donn\\xE9es nominatives (donn\\xE9es pseudonymis\\xE9es).\\n Ces donn\\xE9es contribueront \\xE0 produire des statistiques permettant\\n d\\u2019observer et d\\u2019analyser les effets de l\\u2019exp\\xE9rimentation. Plusieurs\\n types de donn\\xE9es pourront \\xEAtre utilis\\xE9es :\\n
\\n
\\n
\\n Donn\\xE9es transmises \\xE0 l\\u2019Assurance Maladie, par les professionnels\\n participant pour d\\xE9crire l\\u2019activit\\xE9 r\\xE9alis\\xE9e dans le cadre de\\n l\\u2019exp\\xE9rimentation : il s\\u2019agit de donn\\xE9es issues de votre dossier\\n m\\xE9dical d\\xE9crivant votre prise en charge (consultations,\\n interventions chirurgicales, examens, actions de d\\xE9pistage\\u2026) ou\\n votre \\xE9tat de sant\\xE9 (r\\xE9sultats de vos examens par exemple) ;\\n ces donn\\xE9es seront toujours trait\\xE9es\\n sans aucune donn\\xE9e directement identifiante ;\\n
\\n
\\n Donn\\xE9es compl\\xE9mentaires de remboursement des soins - qui sont\\n dispens\\xE9s dans le cadre de l\\u2019exp\\xE9rimentation - et qui auront \\xE9t\\xE9\\n transmises par vos soignants \\xE0 l\\u2019Assurance maladie, sur une\\n plateforme s\\xE9curis\\xE9e de facturation d\\xE9di\\xE9e ;\\n
\\n
\\n Donn\\xE9es concernant tous les autres remboursements de vos soins,\\n issues du Syst\\xE8me National des Donn\\xE9es de Sant\\xE9 (SNDS) g\\xE9r\\xE9 par\\n l\\u2019Assurance Maladie.\\n
\\n
\\n
\\n Ces donn\\xE9es pourront \\xEAtre crois\\xE9es entre elles. Pour la r\\xE9alisation\\n de ces croisements, certaines donn\\xE9es identifiantes seront\\n transmises \\xE0 un tiers de confiance qui fera le lien entre les\\n diff\\xE9rentes sources de donn\\xE9es sans avoir acc\\xE8s aux donn\\xE9es\\n elles-m\\xEAmes.\\n
\\n
\\n De plus, dans certains cas, nous souhaiterions \\xE9galement pouvoir\\n recueillir votre avis sur votre accompagnement dans le cadre de\\n l\\u2019exp\\xE9rimentation. Vous pourrez alors \\xEAtre contact\\xE9.e pour r\\xE9pondre\\n \\xE0 une enqu\\xEAte ou participer \\xE0 des entretiens avec les \\xE9valuateurs.\\n Votre participation est totalement volontaire, vos r\\xE9ponses ne\\n permettront pas de vous identifier et les professionnels de sant\\xE9\\n qui vous suivent n\\u2019en auront pas connaissance.\\n
\\n
\\n Les donn\\xE9es recueillies \\xE0 des fins d\\u2019\\xE9valuations seront conserv\\xE9es\\n sous une forme ne permettant pas de vous identifier directement pour\\n une dur\\xE9e de 3 ans apr\\xE8s la fin de l\\u2019exp\\xE9rimentation.\\n
\\n
\\n Conform\\xE9ment au R\\xE8glement G\\xE9n\\xE9ral sur la Protection des Donn\\xE9es\\n (RGPD), vous pouvez \\xE0 tout moment vous opposer au traitement de vos\\n donn\\xE9es dans le cadre de l\\u2019\\xE9valuation des \\xAB exp\\xE9rimentations Article\\n 51 \\xBB ou \\xE0 la transmission de vos donn\\xE9es de contact aux \\xE9valuateurs.\\n De m\\xEAme, vous pouvez exercer votre droit d\\u2019acc\\xE8s \\xE0 ces donn\\xE9es ou de\\n rectification.\\n Ces demandes ne modifieront en rien votre prise en charge ni le\\n remboursement des soins par l\\u2019Assurance maladie.\\n
\\n
\\n Ces droits, s\\u2019exercent aupr\\xE8s du D\\xE9l\\xE9gu\\xE9 \\xE0 la Protection Des donn\\xE9es\\n (DPO) du responsable de traitement. Vous pouvez leur adresser vos\\n demandes :\\n
\\n
\\n
\\n Par e-mail, \\xE0 l\\u2019adresse \\xE9lectronique suivante :\\n donneespersonnelles@semeia.io\\n
\\n
\\n Par courrier postal \\xE0 l\\u2019adresse suivante : 174, quai de Jemmapes,\\n 75010 Paris France\\n
\\n
\\n
\\n Vous pouvez introduire une r\\xE9clamation aupr\\xE8s de la Commission\\n nationale de l\\u2019informatique et des libert\\xE9s (CNIL), 3, place de\\n Fontenoy TSA 80715 75334 Paris Cedex 07.\\n
\\n \\n
\\n {{/if}}\\n
\\n Fermer\\n
\\n\\n \\n\", {\n moduleName: \"core/components/legal-info/terms-of-use/index.hbs\"\n});","/* import __COLOCATED_TEMPLATE__ from './index.hbs.js'; */\nvar _class, _descriptor, _descriptor2, _descriptor3;\nfunction _initializerDefineProperty(e, i, r, l) { r && Object.defineProperty(e, i, { enumerable: r.enumerable, configurable: r.configurable, writable: r.writable, value: r.initializer ? r.initializer.call(l) : void 0 }); }\nfunction _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }\nfunction _toPropertyKey(t) { var i = _toPrimitive(t, \"string\"); return \"symbol\" == typeof i ? i : i + \"\"; }\nfunction _toPrimitive(t, r) { if (\"object\" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || \"default\"); if (\"object\" != typeof i) return i; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (\"string\" === r ? String : Number)(t); }\nfunction _applyDecoratedDescriptor(i, e, r, n, l) { var a = {}; return Object.keys(n).forEach(function (i) { a[i] = n[i]; }), a.enumerable = !!a.enumerable, a.configurable = !!a.configurable, (\"value\" in a || a.initializer) && (a.writable = !0), a = r.slice().reverse().reduce(function (r, n) { return n(i, e, r) || r; }, a), l && void 0 !== a.initializer && (a.value = a.initializer ? a.initializer.call(l) : void 0, a.initializer = void 0), void 0 === a.initializer ? (Object.defineProperty(i, e, a), null) : a; }\nfunction _initializerWarningHelper(r, e) { throw Error(\"Decorating class property failed. Please ensure that transform-class-properties is enabled and runs after the decorators transform.\"); }\nimport { action } from \"@ember/object\";\nimport { service } from \"@ember/service\";\nimport Component from \"@glimmer/component\";\nimport NavigationService from \"core/services/navigation\";\nimport SemeiaSessionService from \"core/services/session\";\nimport TermsOfUseService from \"core/services/terms-of-use\";\nlet LegalInfoTermsOfUseComponent = (_class = class LegalInfoTermsOfUseComponent extends Component {\n constructor(...args) {\n super(...args);\n _initializerDefineProperty(this, \"session\", _descriptor, this);\n _initializerDefineProperty(this, \"navigation\", _descriptor2, this);\n _initializerDefineProperty(this, \"termsOfUse\", _descriptor3, this);\n }\n get displayArticle51() {\n const allowedFur = [\"cardio-transplant\", \"hepato-transplant\", \"pneumo-transplant\"];\n return this.session.patient?.followUpReason ? allowedFur.includes(this.session.patient.followUpReason) : false;\n }\n get shouldAcceptLatestTermsOfUseVersion() {\n return Boolean(this.session?.user) && !this.session?.user?.isAcceptedTermsOfUse;\n }\n back() {\n this.navigation.back();\n }\n}, _descriptor = _applyDecoratedDescriptor(_class.prototype, \"session\", [service], {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: null\n}), _descriptor2 = _applyDecoratedDescriptor(_class.prototype, \"navigation\", [service], {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: null\n}), _descriptor3 = _applyDecoratedDescriptor(_class.prototype, \"termsOfUse\", [service], {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: null\n}), _applyDecoratedDescriptor(_class.prototype, \"back\", [action], Object.getOwnPropertyDescriptor(_class.prototype, \"back\"), _class.prototype), _class);\nexport { LegalInfoTermsOfUseComponent as default };","import { precompileTemplate } from \"@ember/template-compilation\";\nexport default precompileTemplate(\"{{page-title \\\"Informations légales\\\"}}\\n\\n\",{ moduleName: \"parog-web/templates/view-terms-of-use.hbs\" })","import { precompileTemplate } from \"@ember/template-compilation\";\nexport default precompileTemplate(\"Home\\n\\n\\n Click me to make a change\\n \\n\",{ moduleName: \"parog-web/test-routes/formy/template.hbs\" })",null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,"// Top level file is just a mixin of submodules & constants\n'use strict';\n\nconst { Deflate, deflate, deflateRaw, gzip } = require('./lib/deflate');\n\nconst { Inflate, inflate, inflateRaw, ungzip } = require('./lib/inflate');\n\nconst constants = require('./lib/zlib/constants');\n\nmodule.exports.Deflate = Deflate;\nmodule.exports.deflate = deflate;\nmodule.exports.deflateRaw = deflateRaw;\nmodule.exports.gzip = gzip;\nmodule.exports.Inflate = Inflate;\nmodule.exports.inflate = inflate;\nmodule.exports.inflateRaw = inflateRaw;\nmodule.exports.ungzip = ungzip;\nmodule.exports.constants = constants;\n","'use strict';\n\n\nconst zlib_deflate = require('./zlib/deflate');\nconst utils = require('./utils/common');\nconst strings = require('./utils/strings');\nconst msg = require('./zlib/messages');\nconst ZStream = require('./zlib/zstream');\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH,\n Z_OK, Z_STREAM_END,\n Z_DEFAULT_COMPRESSION,\n Z_DEFAULT_STRATEGY,\n Z_DEFLATED\n} = require('./zlib/constants');\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n this.options = utils.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY\n }, options || {});\n\n let opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n let status = zlib_deflate.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n if (opt.header) {\n zlib_deflate.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n let dict;\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n // If we need to compress text, change encoding to utf8.\n dict = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = zlib_deflate.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n let status, _flush_mode;\n\n if (this.ended) { return false; }\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n // Make sure avail_out > 6 to avoid repeating markers\n if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n status = zlib_deflate.deflate(strm, _flush_mode);\n\n // Ended => flush and finish\n if (status === Z_STREAM_END) {\n if (strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n }\n status = zlib_deflate.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK;\n }\n\n // Flush if out buffer full\n if (strm.avail_out === 0) {\n this.onData(strm.output);\n continue;\n }\n\n // Flush if requested and has data\n if (_flush_mode > 0 && strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n this.result = utils.flattenChunks(this.chunks);\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n const deflator = new Deflate(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg || msg[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate(input, options);\n}\n\n\nmodule.exports.Deflate = Deflate;\nmodule.exports.deflate = deflate;\nmodule.exports.deflateRaw = deflateRaw;\nmodule.exports.gzip = gzip;\nmodule.exports.constants = require('./zlib/constants');\n","'use strict';\n\n\nconst zlib_inflate = require('./zlib/inflate');\nconst utils = require('./utils/common');\nconst strings = require('./utils/strings');\nconst msg = require('./zlib/messages');\nconst ZStream = require('./zlib/zstream');\nconst GZheader = require('./zlib/gzheader');\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH, Z_FINISH,\n Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = require('./zlib/constants');\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n this.options = utils.assign({\n chunkSize: 1024 * 64,\n windowBits: 15,\n to: ''\n }, options || {});\n\n const opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits |= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n let status = zlib_inflate.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n this.header = new GZheader();\n\n zlib_inflate.inflateGetHeader(this.strm, this.header);\n\n // Setup dictionary\n if (opt.dictionary) {\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n opt.dictionary = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n opt.dictionary = new Uint8Array(opt.dictionary);\n }\n if (opt.raw) { //In raw mode we need to set the dictionary early\n status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n }\n }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n * `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n const dictionary = this.options.dictionary;\n let status, _flush_mode, last_avail_out;\n\n if (this.ended) return false;\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n // Convert data if needed\n if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = zlib_inflate.inflate(strm, _flush_mode);\n\n if (status === Z_NEED_DICT && dictionary) {\n status = zlib_inflate.inflateSetDictionary(strm, dictionary);\n\n if (status === Z_OK) {\n status = zlib_inflate.inflate(strm, _flush_mode);\n } else if (status === Z_DATA_ERROR) {\n // Replace code with more verbose\n status = Z_NEED_DICT;\n }\n }\n\n // Skip snyc markers if more data follows and not raw mode\n while (strm.avail_in > 0 &&\n status === Z_STREAM_END &&\n strm.state.wrap > 0 &&\n data[strm.next_in] !== 0)\n {\n zlib_inflate.inflateReset(strm);\n status = zlib_inflate.inflate(strm, _flush_mode);\n }\n\n switch (status) {\n case Z_STREAM_ERROR:\n case Z_DATA_ERROR:\n case Z_NEED_DICT:\n case Z_MEM_ERROR:\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n // Remember real `avail_out` value, because we may patch out buffer content\n // to align utf8 strings boundaries.\n last_avail_out = strm.avail_out;\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n if (this.options.to === 'string') {\n\n let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n let tail = strm.next_out - next_out_utf8;\n let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail & realign counters\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n this.onData(utf8str);\n\n } else {\n this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n }\n }\n }\n\n // Must repeat iteration if out buffer is full\n if (status === Z_OK && last_avail_out === 0) continue;\n\n // Finalize if end of stream reached.\n if (status === Z_STREAM_END) {\n status = zlib_inflate.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return true;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n * each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err) {\n * console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n const inflator = new Inflate(options);\n\n inflator.push(input);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) throw inflator.msg || msg[inflator.err];\n\n return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nmodule.exports.Inflate = Inflate;\nmodule.exports.inflate = inflate;\nmodule.exports.inflateRaw = inflateRaw;\nmodule.exports.ungzip = inflate;\nmodule.exports.constants = require('./zlib/constants');\n","'use strict';\n\n\nconst _has = (obj, key) => {\n return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nmodule.exports.assign = function (obj /*from1, from2, from3, ...*/) {\n const sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n const source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (const p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// Join array of chunks to single array.\nmodule.exports.flattenChunks = (chunks) => {\n // calculate data length\n let len = 0;\n\n for (let i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n const result = new Uint8Array(len);\n\n for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n let chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n};\n","// String encode/decode helpers\n'use strict';\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nmodule.exports.string2buf = (str) => {\n if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n return new TextEncoder().encode(str);\n }\n\n let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new Uint8Array(buf_len);\n\n // convert\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | (c >>> 6);\n buf[i++] = 0x80 | (c & 0x3f);\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | (c >>> 12);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | (c >>> 18);\n buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n // On Chrome, the arguments in a function call that are allowed is `65534`.\n // If the length of the buffer is smaller than that, we can use this optimization,\n // otherwise we will take a slower path.\n if (len < 65534) {\n if (buf.subarray && STR_APPLY_UIA_OK) {\n return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n }\n }\n\n let result = '';\n for (let i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n};\n\n\n// convert array to string\nmodule.exports.buf2string = (buf, max) => {\n const len = max || buf.length;\n\n if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n return new TextDecoder().decode(buf.subarray(0, max));\n }\n\n let i, out;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n const utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n let c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n let c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) | (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nmodule.exports.utf8border = (buf, max) => {\n\n max = max || buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n let pos = max - 1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means buffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n","'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n let s1 = (adler & 0xffff) |0,\n s2 = ((adler >>> 16) & 0xffff) |0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) |0;\n s2 = (s2 + s1) |0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 | (s2 << 16)) |0;\n};\n\n\nmodule.exports = adler32;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n","'use strict';\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n let c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n const t = crcTable;\n const end = pos + len;\n\n crc ^= -1;\n\n for (let i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n};\n\n\nmodule.exports = crc32;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = require('./trees');\nconst adler32 = require('./adler32');\nconst crc32 = require('./crc32');\nconst msg = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH, Z_PARTIAL_FLUSH, Z_FULL_FLUSH, Z_FINISH, Z_BLOCK,\n Z_OK, Z_STREAM_END, Z_STREAM_ERROR, Z_DATA_ERROR, Z_BUF_ERROR,\n Z_DEFAULT_COMPRESSION,\n Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY,\n Z_UNKNOWN,\n Z_DEFLATED\n} = require('./constants');\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES = 30;\n/* number of distance codes */\nconst BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE = 42; /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE = 57; /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE = 69; /* gzip extra block -> NAME_STATE */\nconst NAME_STATE = 73; /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE = 91; /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE = 103; /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE = 113; /* deflate -> FINISH_STATE */\nconst FINISH_STATE = 666; /* stream complete */\n\nconst BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n strm.msg = msg[errorCode];\n return errorCode;\n};\n\nconst rank = (f) => {\n return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n let n, m;\n let p;\n let wsize = s.w_size;\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= wsize ? m - wsize : 0);\n } while (--n);\n n = wsize;\n//#ifndef FASTEST\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= wsize ? m - wsize : 0);\n /* If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n */\n } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n const s = strm.state;\n\n //_tr_flush_bits(s);\n let len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n};\n\n\nconst flush_block_only = (s, last) => {\n _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n // put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n let len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n let chain_length = s.max_chain_length; /* max hash chain length */\n let scan = s.strstart; /* current string */\n let match; /* matched string */\n let len; /* length of current match */\n let best_len = s.prev_length; /* best match length so far */\n let nice_match = s.nice_match; /* stop if match long enough */\n const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n const _win = s.window; // shortcut\n\n const wmask = s.w_mask;\n const prev = s.prev;\n\n /* Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n */\n\n const strend = s.strstart + MAX_MATCH;\n let scan_end1 = _win[scan + best_len - 1];\n let scan_end = _win[scan + best_len];\n\n /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n */\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n /* Do not waste too much time if we already have a good match: */\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n /* Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n */\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n /* Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n */\n\n if (_win[match + best_len] !== scan_end ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n /* The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n */\n scan += 2;\n match++;\n // Assert(*scan == *match, \"match[2]?\");\n\n /* We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n */\n do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n */\nconst fill_window = (s) => {\n\n const _w_size = s.w_size;\n let n, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n /* Deal with !@#$% 64K limit: */\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // /* Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // */\n // more--;\n // }\n //}\n\n\n /* If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n */\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n /* we now have strstart >= MAX_DIST */\n s.block_start -= _w_size;\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n slide_hash(s);\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n /* If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2*WSIZE + 2\n * In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2*WSIZE so more >= 2.\n * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n */\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n */\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n /* If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n */\n// if (s.high_water < s.window_size) {\n// const curr = s.strstart + s.lookahead;\n// let init = 0;\n//\n// if (s.high_water < curr) {\n// /* Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// */\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// /* High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// */\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n /* Smallest worthy block size when not flushing or finishing. By default\n * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n * large input and output buffers, the stored block size will be larger.\n */\n let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n /* Copy as many min_block or larger stored blocks directly to next_out as\n * possible. If flushing, copy the remaining available input to next_out as\n * stored blocks, if there is enough space.\n */\n let len, left, have, last = 0;\n let used = s.strm.avail_in;\n do {\n /* Set len to the maximum size block that we can copy directly with the\n * available input data and output space. Set left to how much of that\n * would be copied from what's left in the window.\n */\n len = 65535/* MAX_STORED */; /* maximum deflate stored block length */\n have = (s.bi_valid + 42) >> 3; /* number of header bytes */\n if (s.strm.avail_out < have) { /* need room for header */\n break;\n }\n /* maximum stored block length that will fit in avail_out: */\n have = s.strm.avail_out - have;\n left = s.strstart - s.block_start; /* bytes left in window */\n if (len > left + s.strm.avail_in) {\n len = left + s.strm.avail_in; /* limit len to the input */\n }\n if (len > have) {\n len = have; /* limit len to the output */\n }\n\n /* If the stored block would be less than min_block in length, or if\n * unable to copy all of the available input when flushing, then try\n * copying to the window and the pending buffer instead. Also don't\n * write an empty block when flushing -- deflate() does that.\n */\n if (len < min_block && ((len === 0 && flush !== Z_FINISH) ||\n flush === Z_NO_FLUSH ||\n len !== left + s.strm.avail_in)) {\n break;\n }\n\n /* Make a dummy stored block in pending to get the header bytes,\n * including any pending bits. This also updates the debugging counts.\n */\n last = flush === Z_FINISH && len === left + s.strm.avail_in ? 1 : 0;\n _tr_stored_block(s, 0, 0, last);\n\n /* Replace the lengths in the dummy stored block with len. */\n s.pending_buf[s.pending - 4] = len;\n s.pending_buf[s.pending - 3] = len >> 8;\n s.pending_buf[s.pending - 2] = ~len;\n s.pending_buf[s.pending - 1] = ~len >> 8;\n\n /* Write the stored block header bytes. */\n flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n// /* Update debugging counts for the data about to be copied. */\n// s->compressed_len += len << 3;\n// s->bits_sent += len << 3;\n//#endif\n\n /* Copy uncompressed bytes from the window to next_out. */\n if (left) {\n if (left > len) {\n left = len;\n }\n //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n s.strm.next_out += left;\n s.strm.avail_out -= left;\n s.strm.total_out += left;\n s.block_start += left;\n len -= left;\n }\n\n /* Copy uncompressed bytes directly from next_in to next_out, updating\n * the check value.\n */\n if (len) {\n read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n s.strm.next_out += len;\n s.strm.avail_out -= len;\n s.strm.total_out += len;\n }\n } while (last === 0);\n\n /* Update the sliding window with the last s->w_size bytes of the copied\n * data, or append all of the copied data to the existing window if less\n * than s->w_size bytes were copied. Also update the number of bytes to\n * insert in the hash tables, in the event that deflateParams() switches to\n * a non-zero compression level.\n */\n used -= s.strm.avail_in; /* number of input bytes directly copied */\n if (used) {\n /* If any input was used, then no unused input remains in the window,\n * therefore s->block_start == s->strstart.\n */\n if (used >= s.w_size) { /* supplant the previous history */\n s.matches = 2; /* clear hash */\n //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n s.strstart = s.w_size;\n s.insert = s.strstart;\n }\n else {\n if (s.window_size - s.strstart <= used) {\n /* Slide the window down. */\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; /* add a pending slide_hash() */\n }\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n s.strstart += used;\n s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n }\n s.block_start = s.strstart;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n /* If the last block was written to next_out, then done. */\n if (last) {\n return BS_FINISH_DONE;\n }\n\n /* If flushing and all input has been consumed, then done. */\n if (flush !== Z_NO_FLUSH && flush !== Z_FINISH &&\n s.strm.avail_in === 0 && s.strstart === s.block_start) {\n return BS_BLOCK_DONE;\n }\n\n /* Fill the window with any remaining input. */\n have = s.window_size - s.strstart;\n if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n /* Slide the window down. */\n s.block_start -= s.w_size;\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; /* add a pending slide_hash() */\n }\n have += s.w_size; /* more space now */\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n if (have > s.strm.avail_in) {\n have = s.strm.avail_in;\n }\n if (have) {\n read_buf(s.strm, s.window, s.strstart, have);\n s.strstart += have;\n s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n /* There was not enough avail_out to write a complete worthy or flushed\n * stored block to next_out. Write a stored block to pending instead, if we\n * have enough input for a worthy block, or if flushing and there is enough\n * room for the remaining input as a stored block in the pending buffer.\n */\n have = (s.bi_valid + 42) >> 3; /* number of header bytes */\n /* maximum stored block length that will fit in pending: */\n have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n min_block = have > s.w_size ? s.w_size : have;\n left = s.strstart - s.block_start;\n if (left >= min_block ||\n ((left || flush === Z_FINISH) && flush !== Z_NO_FLUSH &&\n s.strm.avail_in === 0 && left <= have)) {\n len = left > have ? have : left;\n last = flush === Z_FINISH && s.strm.avail_in === 0 &&\n len === left ? 1 : 0;\n _tr_stored_block(s, s.block_start, len, last);\n s.block_start += len;\n flush_pending(s.strm);\n }\n\n /* We've done all we can with the available input and output. */\n return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n let hash_head; /* head of the hash chain */\n let bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n let hash_head; /* head of hash chain */\n let bflush; /* set if current block must be flushed */\n\n let max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n let bflush; /* set if current block must be flushed */\n let prev; /* byte at distance one to match */\n let scan, strend; /* scan goes up to strend for length of run */\n\n const _win = s.window;\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n */\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n let bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we have a literal to write. */\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n}\n\nconst configuration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\n */\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* w_size - 1 */\n\n this.window = null;\n /* Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n */\n\n this.window_size = 0;\n /* Actual size of window: 2*wSize, except when the user input buffer\n * is directly used as sliding window.\n */\n\n this.prev = null;\n /* Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n */\n\n this.head = null; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* hash_size-1 */\n\n this.hash_shift = 0;\n /* Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n */\n\n this.block_start = 0;\n /* Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n */\n\n this.match_length = 0; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* number of valid bytes ahead in window */\n\n this.prev_length = 0;\n /* Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n */\n\n this.max_chain_length = 0;\n /* To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n */\n\n this.max_lazy_match = 0;\n /* Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n */\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n /* Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n */\n\n this.level = 0; /* compression level (1..9) */\n this.strategy = 0; /* favor or force Huffman coding*/\n\n this.good_match = 0;\n /* Use a faster search when the previous match is longer than this */\n\n this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n /* used by trees.c: */\n\n /* Didn't use ct_data typedef below to suppress compiler warning */\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\n // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2);\n this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2);\n this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new Uint16Array(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\n /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n */\n\n this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.sym_buf = 0; /* buffer for distances and literals/lengths */\n\n this.lit_bufsize = 0;\n /* Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n */\n\n this.sym_next = 0; /* running index in sym_buf */\n this.sym_end = 0; /* symbol table full when sym_next reaches this */\n\n this.opt_len = 0; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n */\n this.bi_valid = 0;\n /* Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n */\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n /* High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const s = strm.state;\n if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n s.status !== GZIP_STATE &&\n//#endif\n s.status !== EXTRA_STATE &&\n s.status !== NAME_STATE &&\n s.status !== COMMENT_STATE &&\n s.status !== HCRC_STATE &&\n s.status !== BUSY_STATE &&\n s.status !== FINISH_STATE)) {\n return 1;\n }\n return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n const s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n /* was made negative by deflate(..., Z_FINISH); */\n }\n s.status =\n//#ifdef GZIP\n s.wrap === 2 ? GZIP_STATE :\n//#endif\n s.wrap ? INIT_STATE : BUSY_STATE;\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = -2;\n _tr_init(s);\n return Z_OK;\n};\n\n\nconst deflateReset = (strm) => {\n\n const ret = deflateResetKeep(strm);\n if (ret === Z_OK) {\n lm_init(strm.state);\n }\n return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n return Z_STREAM_ERROR;\n }\n strm.state.gzhead = head;\n return Z_OK;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR;\n }\n let wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n const s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n s.status = INIT_STATE; /* to pass state test in deflateReset() */\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new Uint8Array(s.w_size * 2);\n s.head = new Uint16Array(s.hash_size);\n s.prev = new Uint16Array(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet */\n\n s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n /* We overlay pending_buf and sym_buf. This works since the average size\n * for length/distance pairs over any compressed block is assured to be 31\n * bits or less.\n *\n * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n * possible fixed-codes length/distance pair is then 31 bits total.\n *\n * sym_buf starts one-fourth of the way into pending_buf. So there are\n * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n * in sym_buf is three bytes -- two for the distance and one for the\n * literal/length. As each symbol is consumed, the pointer to the next\n * sym_buf value to read moves forward three bytes. From that symbol, up to\n * 31 bits are written to pending_buf. The closest the written pending_buf\n * bits gets to the next sym_buf symbol to read is just before the last\n * code is written. At that time, 31*(n-2) bits have been written, just\n * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n * symbols are written.) The closest the writing gets to what is unread is\n * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n * can range from 128 to 32768.\n *\n * Therefore, at a minimum, there are 142 bits of space between what is\n * written and what is read in the overlain buffers, so the symbols cannot\n * be overwritten by the compressed data. That space is actually 139 bits,\n * due to the three-bit fixed-code block header.\n *\n * That covers the case where either Z_FIXED is specified, forcing fixed\n * codes, or when the use of fixed codes is chosen, because that choice\n * results in a smaller compressed block than dynamic codes. That latter\n * condition then assures that the above analysis also covers all dynamic\n * blocks. A dynamic-code block will only be chosen to be emitted if it has\n * fewer bits than a fixed-code block would for the same set of symbols.\n * Therefore its average symbol length is assured to be less than 31. So\n * the compressed data for a dynamic block also cannot overwrite the\n * symbols from which it is being constructed.\n */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->sym_buf = s->pending_buf + s->lit_bufsize;\n s.sym_buf = s.lit_bufsize;\n\n //s->sym_end = (s->lit_bufsize - 1) * 3;\n s.sym_end = (s.lit_bufsize - 1) * 3;\n /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n};\n\n\n/* ========================================================================= */\nconst deflate = (strm, flush) => {\n\n if (deflateStateCheck(strm) || flush > Z_BLOCK || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n }\n\n const s = strm.state;\n\n if (!strm.output ||\n (strm.avail_in !== 0 && !strm.input) ||\n (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n }\n\n const old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n /* Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n */\n s.last_flush = -1;\n return Z_OK;\n }\n\n /* Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n */\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* Write the header */\n if (s.status === INIT_STATE && s.wrap === 0) {\n s.status = BUSY_STATE;\n }\n if (s.status === INIT_STATE) {\n /* zlib header */\n let header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n let level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n\n /* Compression must start with an empty pending buffer */\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK;\n }\n }\n//#ifdef GZIP\n if (s.status === GZIP_STATE) {\n /* gzip header */\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n\n /* Compression must start with an empty pending buffer */\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK;\n }\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n let beg = s.pending; /* start of bytes to update crc */\n let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n while (s.pending + left > s.pending_buf_size) {\n let copy = s.pending_buf_size - s.pending;\n // zmemcpy(s.pending_buf + s.pending,\n // s.gzhead.extra + s.gzindex, copy);\n s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n s.pending = s.pending_buf_size;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex += copy;\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK;\n }\n beg = 0;\n left -= copy;\n }\n // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n // TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n let gzhead_extra = new Uint8Array(s.gzhead.extra);\n // zmemcpy(s->pending_buf + s->pending,\n // s->gzhead->extra + s->gzindex, left);\n s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n s.pending += left;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = NAME_STATE;\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n let beg = s.pending; /* start of bytes to update crc */\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK;\n }\n beg = 0;\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = COMMENT_STATE;\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n let beg = s.pending; /* start of bytes to update crc */\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK;\n }\n beg = 0;\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n }\n s.status = HCRC_STATE;\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK;\n }\n }\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n }\n s.status = BUSY_STATE;\n\n /* Compression must start with an empty pending buffer */\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK;\n }\n }\n//#endif\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n let bstate = s.level === 0 ? deflate_stored(s, flush) :\n s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush);\n\n if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR next call, see above */\n }\n return Z_OK;\n /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n */\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n _tr_align(s);\n }\n else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n _tr_stored_block(s, 0, 0, false);\n /* For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n */\n if (flush === Z_FULL_FLUSH) {\n /*** CLEAR_HASH(s); ***/ /* forget history */\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK;\n }\n }\n }\n\n if (flush !== Z_FINISH) { return Z_OK; }\n if (s.wrap <= 0) { return Z_STREAM_END; }\n\n /* Write the trailer */\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n /* If avail_out is zero, the application will call deflate again\n * to flush the rest.\n */\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n};\n\n\nconst deflateEnd = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR;\n }\n\n const status = strm.state.status;\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n let dictLength = dictionary.length;\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR;\n }\n\n const s = strm.state;\n const wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR;\n }\n\n /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n if (wrap === 1) {\n /* adler32(strm->adler, dictionary, dictLength); */\n strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; /* avoid computing Adler-32 in read_buf */\n\n /* if dictionary would fill window, just replace the history */\n if (dictLength >= s.w_size) {\n if (wrap === 0) { /* already empty otherwise */\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n /* use the tail */\n // dictionary = dictionary.slice(dictLength - s.w_size);\n let tmpDict = new Uint8Array(s.w_size);\n tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n const avail = strm.avail_in;\n const next = strm.next_in;\n const input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n let str = s.strstart;\n let n = s.lookahead - (MIN_MATCH - 1);\n do {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK;\n};\n\n\nmodule.exports.deflateInit = deflateInit;\nmodule.exports.deflateInit2 = deflateInit2;\nmodule.exports.deflateReset = deflateReset;\nmodule.exports.deflateResetKeep = deflateResetKeep;\nmodule.exports.deflateSetHeader = deflateSetHeader;\nmodule.exports.deflate = deflate;\nmodule.exports.deflateEnd = deflateEnd;\nmodule.exports.deflateSetDictionary = deflateSetDictionary;\nmodule.exports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n /* true if compressed data believed to be text */\n this.text = 0;\n /* modification time */\n this.time = 0;\n /* extra flags (not used when writing a gzip file) */\n this.xflags = 0;\n /* operating system */\n this.os = 0;\n /* pointer to extra field or Z_NULL if none */\n this.extra = null;\n /* extra field length (valid if extra != Z_NULL) */\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n /* space at extra (only when reading header) */\n // this.extra_max = 0;\n /* pointer to zero-terminated file name or Z_NULL */\n this.name = '';\n /* space at name (only when reading header) */\n // this.name_max = 0;\n /* pointer to zero-terminated comment or Z_NULL */\n this.comment = '';\n /* space at comment (only when reading header) */\n // this.comm_max = 0;\n /* true if there was or will be a header crc */\n this.hcrc = 0;\n /* true when done reading gzip header (not used when writing a gzip file) */\n this.done = false;\n}\n\nmodule.exports = GZheader;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD = 16209; /* got a data error -- remain here until reset */\nconst TYPE = 16191; /* i: waiting for type bits, including last-flag bit */\n\n/*\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n let _in; /* local strm.input */\n let last; /* have enough input while in < last */\n let _out; /* local strm.output */\n let beg; /* inflate()'s initial strm.output */\n let end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n let dmax; /* maximum distance from zlib header */\n//#endif\n let wsize; /* window size or zero if not using window */\n let whave; /* valid bytes in the window */\n let wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n let s_window; /* allocated sliding window, if wsize != 0 */\n let hold; /* local strm.hold */\n let bits; /* local strm.bits */\n let lcode; /* local strm.lencode */\n let dcode; /* local strm.distcode */\n let lmask; /* mask for first level of length codes */\n let dmask; /* mask for first level of distance codes */\n let here; /* retrieved table entry */\n let op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n let len; /* match length, unused bytes */\n let dist; /* match distance */\n let from; /* where to copy match from */\n let from_source;\n\n\n let input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n const state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* literal */\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* minimum length is three */\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = require('./adler32');\nconst crc32 = require('./crc32');\nconst inflate_fast = require('./inffast');\nconst inflate_table = require('./inftrees');\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_FINISH, Z_BLOCK, Z_TREES,\n Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR, Z_BUF_ERROR,\n Z_DEFLATED\n} = require('./constants');\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst HEAD = 16180; /* i: waiting for magic header */\nconst FLAGS = 16181; /* i: waiting for method and flags (gzip) */\nconst TIME = 16182; /* i: waiting for modification time (gzip) */\nconst OS = 16183; /* i: waiting for extra flags and operating system (gzip) */\nconst EXLEN = 16184; /* i: waiting for extra length (gzip) */\nconst EXTRA = 16185; /* i: waiting for extra bytes (gzip) */\nconst NAME = 16186; /* i: waiting for end of file name (gzip) */\nconst COMMENT = 16187; /* i: waiting for end of comment (gzip) */\nconst HCRC = 16188; /* i: waiting for header crc (gzip) */\nconst DICTID = 16189; /* i: waiting for dictionary check value */\nconst DICT = 16190; /* waiting for inflateSetDictionary() call */\nconst TYPE = 16191; /* i: waiting for type bits, including last-flag bit */\nconst TYPEDO = 16192; /* i: same, but skip check to exit inflate on new block */\nconst STORED = 16193; /* i: waiting for stored size (length and complement) */\nconst COPY_ = 16194; /* i/o: same as COPY below, but only first time in */\nconst COPY = 16195; /* i/o: waiting for input or output to copy stored block */\nconst TABLE = 16196; /* i: waiting for dynamic block table lengths */\nconst LENLENS = 16197; /* i: waiting for code length code lengths */\nconst CODELENS = 16198; /* i: waiting for length/lit and distance code lengths */\nconst LEN_ = 16199; /* i: same as LEN below, but only first time in */\nconst LEN = 16200; /* i: waiting for length/lit/eob code */\nconst LENEXT = 16201; /* i: waiting for length extra bits */\nconst DIST = 16202; /* i: waiting for distance code */\nconst DISTEXT = 16203; /* i: waiting for distance extra bits */\nconst MATCH = 16204; /* o: waiting for output space to copy string */\nconst LIT = 16205; /* o: waiting for output space to write literal */\nconst CHECK = 16206; /* i: waiting for 32-bit check value */\nconst LENGTH = 16207; /* i: waiting for 32-bit length (gzip) */\nconst DONE = 16208; /* finished check, done -- remain here until reset */\nconst BAD = 16209; /* got a data error -- remain here until reset */\nconst MEM = 16210; /* got an inflate() memory error -- remain here until reset */\nconst SYNC = 16211; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip,\n bit 2 true to validate check value */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib), or\n -1 if raw or no header yet */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n this.work = new Uint16Array(288); /* work area for code table building */\n\n /*\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n */\n //this.codes = new Int32Array(ENOUGH); /* space for code tables */\n this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const state = strm.state;\n if (!state || state.strm !== strm ||\n state.mode < HEAD || state.mode > SYNC) {\n return 1;\n }\n return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n const state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.flags = -1;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK;\n};\n\n\nconst inflateReset = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n const state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n let wrap;\n\n /* get the state */\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n const state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 5;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n if (!strm) { return Z_STREAM_ERROR; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n const state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.strm = strm;\n state.window = null/*Z_NULL*/;\n state.mode = HEAD; /* to pass state test in inflateReset2() */\n const ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n lenfix = new Int32Array(512);\n distfix = new Int32Array(32);\n\n /* literal/length table */\n let sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n let dist;\n const state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new Uint8Array(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n state.window.set(src.subarray(end - state.wsize, end), 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n state.window.set(src.subarray(end - copy, end), 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n};\n\n\nconst inflate = (strm, flush) => {\n\n let state;\n let input, output; // input/output buffers\n let next; /* next input INDEX */\n let put; /* next output INDEX */\n let have, left; /* available input and output */\n let hold; /* bit buffer */\n let bits; /* bits in bit buffer */\n let _in, _out; /* save starting available input and output */\n let copy; /* number of stored or match bytes to copy */\n let from; /* where to copy match bytes from */\n let from_source;\n let here = 0; /* current decoding table entry */\n let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //let last; /* parent table entry */\n let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n let len; /* length to copy for repeats, bits to drop */\n let ret; /* return code */\n const hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */\n let opts;\n\n let n; // temporary variable for NEED_BITS\n\n const order = /* permutation of code lengths */\n new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n if (inflateStateCheck(strm) || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n if (state.wbits === 0) {\n state.wbits = 15;\n }\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n if (len > 15 || len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n\n // !!! pako patch. Force use `options.windowBits` if passed.\n // Required to always use max window size by default.\n state.dmax = 1 << state.wbits;\n //state.dmax = 1 << len;\n\n state.flags = 0; /* indicate zlib header */\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Uint8Array(state.head.extra_len);\n }\n state.head.extra.set(\n input.subarray(\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n next + copy\n ),\n /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT;\n }\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n output.set(input.subarray(next, next + copy), put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n /* build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values */\n state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inflate_fast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' instead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if ((state.wrap & 4) && _out) {\n strm.adler = state.check =\n /*UPDATE_CHECK(state.check, put - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /*\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n */\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK || flush !== Z_FINISH))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if ((state.wrap & 4) && _out) {\n strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n if (inflateStateCheck(strm)) {\n return Z_STREAM_ERROR;\n }\n\n let state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n /* check state */\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n const state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n const dictLength = dictionary.length;\n\n let state;\n let dictid;\n let ret;\n\n /* check state */\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR;\n }\n\n /* check for correct dictionary identifier */\n if (state.mode === DICT) {\n dictid = 1; /* adler32(0, null, 0)*/\n /* dictid = adler32(dictid, dictionary, dictLength); */\n dictid = adler32(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR;\n }\n }\n /* copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate */\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK;\n};\n\n\nmodule.exports.inflateReset = inflateReset;\nmodule.exports.inflateReset2 = inflateReset2;\nmodule.exports.inflateResetKeep = inflateResetKeep;\nmodule.exports.inflateInit = inflateInit;\nmodule.exports.inflateInit2 = inflateInit2;\nmodule.exports.inflate = inflate;\nmodule.exports.inflateEnd = inflateEnd;\nmodule.exports.inflateGetHeader = inflateGetHeader;\nmodule.exports.inflateSetDictionary = inflateSetDictionary;\nmodule.exports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n const bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n let len = 0; /* a code's length in bits */\n let sym = 0; /* index of code symbols */\n let min = 0, max = 0; /* minimum and maximum code lengths */\n let root = 0; /* number of index bits for root table */\n let curr = 0; /* number of index bits for current table */\n let drop = 0; /* code bits to drop for sub-table */\n let left = 0; /* number of prefix codes available */\n let used = 0; /* code entries in table used */\n let huff = 0; /* Huffman code */\n let incr; /* for incrementing code, index */\n let fill; /* index for replicating entries */\n let low; /* low bits for current root entry */\n let mask; /* mask for low root bits */\n let next; /* next available space in table */\n let base = null; /* base value table to use */\n// let shoextra; /* extra bits table to use */\n let match; /* use base and extra for symbol >= match */\n const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n let extra = null;\n\n let here_bits, here_op, here_val;\n\n /*\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n */\n\n /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* no symbols to code at all */\n //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /*\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided *table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n */\n\n /* set up for code type */\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES) {\n base = extra = work; /* dummy value--not used */\n match = 20;\n\n } else if (type === LENS) {\n base = lbase;\n extra = lext;\n match = 257;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n match = 0;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* process all codes and make table entries */\n for (;;) {\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] + 1 < match) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] >= match) {\n here_op = extra[work[sym] - match];\n here_val = base[work[sym] - match];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n } while (fill !== 0);\n\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\n }\n\n /* fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) */\n if (huff !== 0) {\n //table.op[next + huff] = 64; /* invalid code marker */\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n }\n\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n\n\nmodule.exports = inflate_table;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 */\n 1: 'stream end', /* Z_STREAM_END 1 */\n 0: '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED = 1;\n//const Z_HUFFMAN_ONLY = 2;\n//const Z_RLE = 3;\nconst Z_FIXED = 4;\n//const Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY = 0;\nconst Z_TEXT = 1;\n//const Z_ASCII = 1; // = Z_TEXT\nconst Z_UNKNOWN = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES = 30;\n/* number of distance codes */\n\nconst BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\n\nconst MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK = 256;\n/* end of block literal code */\n\nconst REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits = /* extra bits for each length code */\n new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits = /* extra bits for each distance code */\n new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits = /* extra bits for each bit length code */\n new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree = new Array((L_CODES + 2) * 2);\nzero(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code = new Array(DIST_CODE_LEN);\nzero(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n let res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n */\nconst gen_bitlen = (s, desc) => {\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n\n const tree = desc.dyn_tree;\n const max_code = desc.max_code;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const extra = desc.stat_desc.extra_bits;\n const base = desc.stat_desc.extra_base;\n const max_length = desc.stat_desc.max_length;\n let h; /* heap index */\n let n, m; /* iterate over the tree elements */\n let bits; /* bit length */\n let xbits; /* extra bits */\n let f; /* frequency */\n let overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS; bits++) {\n s.bl_count[bits] = 0;\n }\n\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n n = s.heap[h];\n bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Tracev((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus */\n\n /* Find the first bit length which could increase: */\n do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n s.bl_count[max_length]--;\n /* The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n */\n overflow -= 2;\n } while (overflow > 0);\n\n /* Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n */\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n tree[m * 2 + 1]/*.Len*/ = bits;\n }\n n--;\n }\n }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n// ct_data *tree; /* the tree to decorate */\n// int max_code; /* largest code with non zero frequency */\n// ushf *bl_count; /* number of codes at each bit length */\n\n const next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n let code = 0; /* running code value */\n let bits; /* bit index */\n let n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\n */\n for (bits = 1; bits <= MAX_BITS; bits++) {\n code = (code + bl_count[bits - 1]) << 1;\n next_code[bits] = code;\n }\n /* Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n */\n //Assert (code + bl_count[MAX_BITS]-1 == (1< {\n\n let n; /* iterates over tree elements */\n let bits; /* bit counter */\n let length; /* length value */\n let code; /* code value */\n let dist; /* distance index */\n const bl_count = new Array(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n /* Initialize the mapping length (0..255) -> length code (0..28) */\n length = 0;\n for (code = 0; code < LENGTH_CODES - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n /* Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n */\n _length_code[length - 1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n */\n gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES; n++) {\n static_dtree[n * 2 + 1]/*.Len*/ = 5;\n static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);\n\n //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n let n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n const _n2 = n * 2;\n const _m2 = m * 2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n// deflate_state *s;\n// ct_data *tree; /* the tree to restore */\n// int k; /* node to move down */\n\n const v = s.heap[k];\n let j = k << 1; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n\n let dist; /* distance of matched string */\n let lc; /* match length or unmatched char (if dist == 0) */\n let sx = 0; /* running index in sym_buf */\n let code; /* the code to send */\n let extra; /* number of extra bits to send */\n\n if (s.sym_next !== 0) {\n do {\n dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n lc = s.pending_buf[s.sym_buf + sx++];\n if (dist === 0) {\n send_code(s, lc, ltree); /* send a literal byte */\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n /* Here, lc is the match length - MIN_MATCH */\n code = _length_code[lc];\n send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\n }\n } /* literal or match pair ? */\n\n /* Check that the overlay between pending_buf and sym_buf is ok: */\n //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n } while (sx < s.sym_next);\n }\n\n send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n\n const tree = desc.dyn_tree;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const elems = desc.stat_desc.elems;\n let n, m; /* iterate over heap elements */\n let max_code = -1; /* largest code with non zero frequency */\n let node; /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/*.Len*/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n\n let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n\n let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n let max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n let rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"block list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n /* block_mask is the bit mask of block-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n let block_mask = 0xf3ffc07f;\n let n;\n\n /* Check for non-textual (\"block-listed\") bytes. */\n for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"allow-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"block-listed\" or \"allow-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init = (s) =>\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n bi_windup(s); /* align on byte boundary */\n put_short(s, stored_len);\n put_short(s, ~stored_len);\n if (stored_len) {\n s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n }\n s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align = (s) => {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n\n let opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n let max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->sym_next / 3));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally = (s, dist, lc) => {\n// deflate_state *s;\n// unsigned dist; /* distance of matched string */\n// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n\n s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc * 2]/*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n dist--; /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n return (s.sym_next === s.sym_end);\n};\n\nmodule.exports._tr_init = _tr_init;\nmodule.exports._tr_stored_block = _tr_stored_block;\nmodule.exports._tr_flush_block = _tr_flush_block;\nmodule.exports._tr_tally = _tr_tally;\nmodule.exports._tr_align = _tr_align;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nmodule.exports = ZStream;\n","import { A } from '@ember/array';\nimport DataAdapter from '@ember/debug/data-adapter';\nimport { addObserver, removeObserver } from '@ember/object/observers';\nimport { inject } from '@ember/service';\nimport { macroCondition, getGlobalConfig } from '@embroider/macros';\nimport { capitalize, underscore } from '@ember-data/request-utils/string';\nimport { recordIdentifierFor } from '@ember-data/store';\nvar __defProp = Object.defineProperty;\nvar __export = (target, all) => {\n for (var name in all) __defProp(target, name, {\n get: all[name],\n enumerable: true\n });\n};\n\n// src/runtime.ts\nvar runtime_exports = {};\n__export(runtime_exports, {\n c: () => decorateClass,\n f: () => decorateFieldV1,\n g: () => decorateFieldV2,\n i: () => initializeDeferredDecorator,\n m: () => decorateMethodV1,\n n: () => decorateMethodV2,\n p: () => decoratePOJO\n});\nvar deferred = /* @__PURE__ */new WeakMap();\nfunction deferDecorator(proto, prop, desc) {\n let map = deferred.get(proto);\n if (!map) {\n map = /* @__PURE__ */new Map();\n deferred.set(proto, map);\n }\n map.set(prop, desc);\n}\nfunction findDeferredDecorator(target, prop) {\n let cursor = target.prototype;\n while (cursor) {\n let desc = deferred.get(cursor)?.get(prop);\n if (desc) {\n return desc;\n }\n cursor = cursor.prototype;\n }\n}\nfunction decorateFieldV1(target, prop, decorators, initializer) {\n return decorateFieldV2(target.prototype, prop, decorators, initializer);\n}\nfunction decorateFieldV2(prototype, prop, decorators, initializer) {\n let desc = {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: null\n };\n if (initializer) {\n desc.initializer = initializer;\n }\n for (let decorator of decorators) {\n desc = decorator(prototype, prop, desc) || desc;\n }\n if (desc.initializer === void 0) {\n Object.defineProperty(prototype, prop, desc);\n } else {\n deferDecorator(prototype, prop, desc);\n }\n}\nfunction decorateMethodV1({\n prototype\n}, prop, decorators) {\n return decorateMethodV2(prototype, prop, decorators);\n}\nfunction decorateMethodV2(prototype, prop, decorators) {\n const origDesc = Object.getOwnPropertyDescriptor(prototype, prop);\n let desc = {\n ...origDesc\n };\n for (let decorator of decorators) {\n desc = decorator(prototype, prop, desc) || desc;\n }\n if (desc.initializer !== void 0) {\n desc.value = desc.initializer ? desc.initializer.call(prototype) : void 0;\n desc.initializer = void 0;\n }\n Object.defineProperty(prototype, prop, desc);\n}\nfunction initializeDeferredDecorator(target, prop) {\n let desc = findDeferredDecorator(target.constructor, prop);\n if (desc) {\n Object.defineProperty(target, prop, {\n enumerable: desc.enumerable,\n configurable: desc.configurable,\n writable: desc.writable,\n value: desc.initializer ? desc.initializer.call(target) : void 0\n });\n }\n}\nfunction decorateClass(target, decorators) {\n return decorators.reduce((accum, decorator) => decorator(accum) || accum, target);\n}\nfunction decoratePOJO(pojo, decorated) {\n for (let [type, prop, decorators] of decorated) {\n if (type === \"field\") {\n decoratePojoField(pojo, prop, decorators);\n } else {\n decorateMethodV2(pojo, prop, decorators);\n }\n }\n return pojo;\n}\nfunction decoratePojoField(pojo, prop, decorators) {\n let desc = {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: () => Object.getOwnPropertyDescriptor(pojo, prop)?.value\n };\n for (let decorator of decorators) {\n desc = decorator(pojo, prop, desc) || desc;\n }\n if (desc.initializer) {\n desc.value = desc.initializer.call(pojo);\n delete desc.initializer;\n }\n Object.defineProperty(pojo, prop, desc);\n}\n\n/**\n # Overview\n\n This package provides the `DataAdapter` which the [Ember Inspector](https://github.com/emberjs/ember-inspector)\n uses to subscribe and retrieve information for the `data` tab in the inspector.\n\n This package adds roughly .6 KB when minified and compressed to your application in production; however,\n you can opt out of shipping this addon in production via options in `ember-cli-build.js`\n\n ```js\n let app = new EmberApp(defaults, {\n emberData: {\n includeDataAdapterInProduction: false\n }\n });\n ```\n\n When using `ember-data` as a dependency of your app, the default is to ship the inspector support to production.\n\n When not using `ember-data` as a dependency but instead using EmberData via declaring specific `@ember-data/`\n dependencies the default is to not ship to production.\n\n @module @ember-data/debug\n @main @ember-data/debug\n*/\n\nconst StoreTypesMap = new WeakMap();\nfunction debugInfo() {\n const relationships = {};\n const expensiveProperties = [];\n const identifier = recordIdentifierFor(this);\n const fields = this.store.schema.fields(identifier);\n const attrGroup = {\n name: 'Attributes',\n properties: ['id'],\n expand: true\n };\n const attributes = attrGroup.properties;\n const groups = [attrGroup];\n for (const field of fields.values()) {\n switch (field.kind) {\n case 'attribute':\n attributes.push(field.name);\n break;\n case 'belongsTo':\n case 'hasMany':\n {\n let properties = relationships[field.kind];\n if (properties === undefined) {\n properties = relationships[field.kind] = [];\n groups.push({\n name: field.kind,\n properties,\n expand: true\n });\n }\n properties.push(field.name);\n expensiveProperties.push(field.name);\n break;\n }\n }\n }\n groups.push({\n name: 'Flags',\n properties: ['isLoaded', 'hasDirtyAttributes', 'isSaving', 'isDeleted', 'isError', 'isNew', 'isValid'],\n expand: false\n });\n return {\n propertyInfo: {\n // include all other mixins / properties (not just the grouped ones)\n includeOtherProperties: true,\n groups: groups,\n // don't pre-calculate unless cached\n expensiveProperties: expensiveProperties\n }\n };\n}\nfunction installDebugInfo(ModelKlass) {\n /**\n Provides info about the model for debugging purposes\n by grouping the properties into more semantic groups.\n Meant to be used by debugging tools such as the Chrome Ember Extension.\n - Groups all attributes in \"Attributes\" group.\n - Groups all belongsTo relationships in \"Belongs To\" group.\n - Groups all hasMany relationships in \"Has Many\" group.\n - Groups all flags in \"Flags\" group.\n - Flags relationship CPs as expensive properties.\n @internal\n */\n ModelKlass.prototype._debugInfo = debugInfo;\n}\nfunction typesMapFor(store) {\n let typesMap = StoreTypesMap.get(store);\n if (typesMap === undefined) {\n typesMap = new Map();\n StoreTypesMap.set(store, typesMap);\n }\n return typesMap;\n}\n\n/**\n Implements `@ember/debug/data-adapter` with for EmberData\n integration with the ember-inspector.\n\n @class InspectorDataAdapter\n @extends DataAdapter\n @private\n*/\nclass InspectorDataAdapter extends DataAdapter {\n static {\n decorateFieldV2(this.prototype, \"store\", [inject('store')]);\n }\n #store = (initializeDeferredDecorator(this, \"store\"), void 0);\n /**\n Specifies how records can be filtered based on the state of the record\n Records returned will need to have a `filterValues`\n property with a key for every name in the returned array\n @method getFilters\n @private\n @return {Array} List of objects defining filters\n The object should have a `name` and `desc` property\n */\n getFilters() {\n return [{\n name: 'isNew',\n desc: 'New'\n }, {\n name: 'isModified',\n desc: 'Modified'\n }, {\n name: 'isClean',\n desc: 'Clean'\n }];\n }\n _nameToClass(type) {\n return this.store.modelFor(type);\n }\n\n /**\n Fetch the model types and observe them for changes.\n Maintains the list of model types without needing the Model package for detection.\n @method watchModelTypes\n @private\n @param {Function} typesAdded Callback to call to add types.\n Takes an array of objects containing wrapped types (returned from `wrapModelType`).\n @param {Function} typesUpdated Callback to call when a type has changed.\n Takes an array of objects containing wrapped types.\n @return {Function} Method to call to remove all observers\n */\n watchModelTypes(typesAdded, typesUpdated) {\n const {\n store\n } = this;\n const discoveredTypes = typesMapFor(store);\n const unsub = store.notifications.subscribe('resource', (identifier, notificationType) => {\n if (notificationType === 'added') {\n this.watchTypeIfUnseen(store, discoveredTypes, identifier.type, typesAdded, typesUpdated, _releaseMethods);\n }\n });\n const _releaseMethods = [() => {\n store.notifications.unsubscribe(unsub);\n }];\n Object.keys(store.identifierCache._cache.resourcesByType).forEach(type => {\n discoveredTypes.set(type, false);\n });\n\n // Add any models that were added during initialization of the app, before the inspector was opened\n discoveredTypes.forEach((_, type) => {\n this.watchTypeIfUnseen(store, discoveredTypes, type, typesAdded, typesUpdated, _releaseMethods);\n });\n const release = () => {\n _releaseMethods.forEach(fn => fn());\n // reset the list so the models can be added if the inspector is re-opened\n // the entries are set to false instead of removed, since the models still exist in the app\n // we just need the inspector to become aware of them\n discoveredTypes.forEach((value, key) => {\n discoveredTypes.set(key, false);\n });\n this.releaseMethods.removeObject(release);\n };\n this.releaseMethods.pushObject(release);\n return release;\n }\n\n /**\n * Loop over the discovered types and use the callbacks from watchModelTypes to notify\n * the consumer of this adapter about the mdoels.\n *\n * @method watchTypeIfUnseen\n * @param {store} store\n * @param {Map} discoveredTypes\n * @param {String} type\n * @param {Function} typesAdded\n * @param {Function} typesUpdated\n * @param {Array} releaseMethods\n * @private\n */\n watchTypeIfUnseen(store, discoveredTypes, type, typesAdded, typesUpdated, releaseMethods) {\n if (discoveredTypes.get(type) !== true) {\n const klass = store.modelFor(type);\n installDebugInfo(klass);\n const wrapped = this.wrapModelType(klass, type);\n releaseMethods.push(this.observeModelType(type, typesUpdated));\n typesAdded([wrapped]);\n discoveredTypes.set(type, true);\n }\n }\n\n /**\n Creates a human readable string used for column headers\n @method columnNameToDesc\n @private\n @param {String} name The attribute name\n @return {String} Human readable string based on the attribute name\n */\n columnNameToDesc(name) {\n return capitalize(underscore(name).replace(/_/g, ' ').trim());\n }\n\n /**\n Get the columns for a given model type\n @method columnsForType\n @private\n @param {Model} typeClass\n @return {Array} An array of columns of the following format:\n name: {String} The name of the column\n desc: {String} Humanized description (what would show in a table column name)\n */\n columnsForType(typeClass) {\n const columns = [{\n name: 'id',\n desc: 'Id'\n }];\n let count = 0;\n typeClass.attributes.forEach((meta, name) => {\n if (count++ > this.attributeLimit) {\n return false;\n }\n const desc = this.columnNameToDesc(name);\n columns.push({\n name: name,\n desc: desc\n });\n });\n return columns;\n }\n\n /**\n Fetches all loaded records for a given type\n @method getRecords\n @private\n @param {Model} modelClass of the record\n @param {String} modelName of the record\n @return {Array} An array of Model records\n This array will be observed for changes,\n so it should update when new records are added/removed\n */\n getRecords(modelClass, modelName) {\n if (arguments.length < 2) {\n // Legacy Ember.js < 1.13 support\n const containerKey = modelClass._debugContainerKey;\n if (containerKey) {\n const match = containerKey.match(/model:(.*)/);\n if (match !== null) {\n modelName = match[1];\n }\n }\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('Cannot find model name. Please upgrade to Ember.js >= 1.13 for Ember Inspector support');\n }\n })(!!modelName) : {};\n return this.store.peekAll(modelName);\n }\n\n /**\n Gets the values for each column\n This is the attribute values for a given record\n @method getRecordColumnValues\n @private\n @param {Model} record to get values from\n @return {Object} Keys should match column names defined by the model type\n */\n getRecordColumnValues(record) {\n let count = 0;\n const columnValues = {\n id: record.id\n };\n record.eachAttribute(key => {\n if (count++ > this.attributeLimit) {\n return false;\n }\n columnValues[key] = record[key];\n });\n return columnValues;\n }\n\n /**\n Returns keywords to match when searching records\n @method getRecordKeywords\n @private\n @param {Model} record\n @return {Array} Relevant keywords for search based on the record's attribute values\n */\n getRecordKeywords(record) {\n const keywords = [record.id];\n record.eachAttribute(key => {\n keywords.push(record[key]);\n });\n return A(keywords);\n }\n\n /**\n Returns the values of filters defined by `getFilters`\n These reflect the state of the record\n @method getRecordFilterValues\n @private\n @param {Model} record\n @return {Object} The record state filter values\n */\n getRecordFilterValues(record) {\n return {\n isNew: record.isNew,\n isModified: record.hasDirtyAttributes && !record.isNew,\n isClean: !record.hasDirtyAttributes\n };\n }\n\n /**\n Returns a color that represents the record's state\n Possible colors: black, blue, green\n @method getRecordColor\n @private\n @param {Model} record\n @return {String} The record color\n */\n getRecordColor(record) {\n let color = 'black';\n if (record.isNew) {\n color = 'green';\n } else if (record.hasDirtyAttributes) {\n color = 'blue';\n }\n return color;\n }\n\n /**\n Observes all relevant properties and re-sends the wrapped record\n when a change occurs\n @method observeRecord\n @private\n @param {Model} record\n @param {Function} recordUpdated Callback used to notify changes\n @return {Function} The function to call to remove all observers\n */\n observeRecord(record, recordUpdated) {\n const releaseMethods = [];\n const keysToObserve = ['id', 'isNew', 'hasDirtyAttributes'];\n record.eachAttribute(key => keysToObserve.push(key));\n keysToObserve.forEach(key => {\n const handler = () => {\n recordUpdated(this.wrapRecord(record));\n };\n addObserver(record, key, handler);\n releaseMethods.push(function () {\n removeObserver(record, key, handler);\n });\n });\n const release = function () {\n releaseMethods.forEach(fn => fn());\n };\n return release;\n }\n}\nconst dataAdapter = macroCondition(getGlobalConfig().WarpDrive.includeDataAdapter) ? InspectorDataAdapter : null;\nexport { dataAdapter as default };","import { deprecate, warn, inspect } from '@ember/debug';\nimport { peekCache } from '@ember-data/store/-private';\nimport { macroCondition, getGlobalConfig } from '@embroider/macros';\nimport { getOrSetGlobal, peekTransient, setTransient } from '@warp-drive/core-types/-private';\nfunction coerceId(id) {\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_NON_STRICT_ID)) {\n let normalized;\n if (id === null || id === undefined || id === '') {\n normalized = null;\n } else {\n normalized = String(id);\n }\n deprecate(`The resource id '<${typeof id}> ${String(id)} ' is not normalized. Update your application code to use '${JSON.stringify(normalized)}' instead.`, normalized === id, {\n id: 'ember-data:deprecate-non-strict-id',\n until: '6.0',\n for: 'ember-data',\n since: {\n available: '5.3',\n enabled: '5.3'\n }\n });\n return normalized;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Resource IDs must be a non-empty string or null. Received '${String(id)}'.`);\n }\n })(id === null || typeof id === 'string' && id.length > 0) : {};\n return id;\n}\nfunction getStore(wrapper) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected a private _store property`);\n }\n })('_store' in wrapper) : {};\n return wrapper._store;\n}\nfunction expandingGet(cache, key1, key2) {\n const mainCache = cache[key1] = cache[key1] || Object.create(null);\n return mainCache[key2];\n}\nfunction expandingSet(cache, key1, key2, value) {\n const mainCache = cache[key1] = cache[key1] || Object.create(null);\n mainCache[key2] = value;\n}\nfunction assertValidRelationshipPayload(graph, op) {\n const relationship = graph.get(op.record, op.field);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot update an implicit relationship`);\n }\n })(isHasMany(relationship) || isBelongsTo(relationship)) : {};\n const payload = op.value;\n const {\n definition,\n identifier,\n state\n } = relationship;\n const {\n type\n } = identifier;\n const {\n field\n } = op;\n const {\n isAsync,\n kind\n } = definition;\n if (payload.links) {\n warn(`You pushed a record of type '${type}' with a relationship '${field}' configured as 'async: false'. You've included a link but no primary data, this may be an error in your payload. EmberData will treat this relationship as known-to-be-empty.`, isAsync || !!payload.data || state.hasReceivedData, {\n id: 'ds.store.push-link-for-sync-relationship'\n });\n } else if (payload.data) {\n if (kind === 'belongsTo') {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`A ${type} record was pushed into the store with the value of ${field} being ${inspect(payload.data)}, but ${field} is a belongsTo relationship so the value must not be an array. You should probably check your data payload or serializer.`);\n }\n })(!Array.isArray(payload.data)) : {};\n assertRelationshipData(getStore(graph.store), identifier, payload.data, definition);\n } else if (kind === 'hasMany') {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`A ${type} record was pushed into the store with the value of ${field} being '${inspect(payload.data)}', but ${field} is a hasMany relationship so the value must be an array. You should probably check your data payload or serializer.`);\n }\n })(Array.isArray(payload.data)) : {};\n if (Array.isArray(payload.data)) {\n for (let i = 0; i < payload.data.length; i++) {\n assertRelationshipData(getStore(graph.store), identifier, payload.data[i], definition);\n }\n }\n }\n }\n}\nfunction isNew(identifier) {\n if (!identifier.id) {\n return true;\n }\n const cache = peekCache(identifier);\n return Boolean(cache?.isNew(identifier));\n}\nfunction isBelongsTo(relationship) {\n return relationship.definition.kind === 'belongsTo';\n}\nfunction isImplicit(relationship) {\n return relationship.definition.isImplicit;\n}\nfunction isHasMany(relationship) {\n return relationship.definition.kind === 'hasMany';\n}\nfunction forAllRelatedIdentifiers(rel, cb) {\n if (isBelongsTo(rel)) {\n if (rel.remoteState) {\n cb(rel.remoteState);\n }\n if (rel.localState && rel.localState !== rel.remoteState) {\n cb(rel.localState);\n }\n } else if (isHasMany(rel)) {\n // TODO\n // rel.remoteMembers.forEach(cb);\n // might be simpler if performance is not a concern\n for (let i = 0; i < rel.remoteState.length; i++) {\n const inverseIdentifier = rel.remoteState[i];\n cb(inverseIdentifier);\n }\n rel.additions?.forEach(cb);\n } else {\n rel.localMembers.forEach(cb);\n rel.remoteMembers.forEach(inverseIdentifier => {\n if (!rel.localMembers.has(inverseIdentifier)) {\n cb(inverseIdentifier);\n }\n });\n }\n}\n\n/*\n Removes the given identifier from BOTH remote AND local state.\n\n This method is useful when either a deletion or a rollback on a new record\n needs to entirely purge itself from an inverse relationship.\n */\nfunction removeIdentifierCompletelyFromRelationship(graph, relationship, value, silenceNotifications) {\n if (isBelongsTo(relationship)) {\n if (relationship.remoteState === value) {\n relationship.remoteState = null;\n }\n if (relationship.localState === value) {\n relationship.localState = null;\n // This allows dematerialized inverses to be rematerialized\n // we shouldn't be notifying here though, figure out where\n // a notification was missed elsewhere.\n {\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n }\n }\n } else if (isHasMany(relationship)) {\n relationship.remoteMembers.delete(value);\n relationship.additions?.delete(value);\n const wasInRemovals = relationship.removals?.delete(value);\n const canonicalIndex = relationship.remoteState.indexOf(value);\n if (canonicalIndex !== -1) {\n relationship.remoteState.splice(canonicalIndex, 1);\n }\n if (!wasInRemovals) {\n const currentIndex = relationship.localState?.indexOf(value);\n if (currentIndex !== -1 && currentIndex !== undefined) {\n relationship.localState.splice(currentIndex, 1);\n // This allows dematerialized inverses to be rematerialized\n // we shouldn't be notifying here though, figure out where\n // a notification was missed elsewhere.\n {\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n }\n }\n }\n } else {\n relationship.remoteMembers.delete(value);\n relationship.localMembers.delete(value);\n }\n}\n\n// TODO add silencing at the graph level\nfunction notifyChange(graph, identifier, key) {\n if (identifier === graph._removing) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`Graph: ignoring relationship change for removed identifier ${String(identifier)} ${key}`);\n }\n return;\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`Graph: notifying relationship change for ${String(identifier)} ${key}`);\n }\n graph.store.notifyChange(identifier, 'relationships', key);\n}\nfunction assertRelationshipData(store, identifier, data, meta) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`A ${identifier.type} record was pushed into the store with the value of ${meta.key} being '${JSON.stringify(data)}', but ${meta.key} is a belongsTo relationship so the value must not be an array. You should probably check your data payload or serializer.`);\n }\n })(!Array.isArray(data)) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Encountered a relationship identifier without a type for the ${meta.kind} relationship '${meta.key}' on <${identifier.type}:${String(identifier.id)}>, expected an identifier with type '${meta.type}' but found\\n\\n'${JSON.stringify(data, null, 2)}'\\n\\nPlease check your serializer and make sure it is serializing the relationship payload into a JSON API format.`);\n }\n })(data === null || 'type' in data && typeof data.type === 'string' && data.type.length) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Encountered a relationship identifier without an id for the ${meta.kind} relationship '${meta.key}' on <${identifier.type}:${String(identifier.id)}>, expected an identifier but found\\n\\n'${JSON.stringify(data, null, 2)}'\\n\\nPlease check your serializer and make sure it is serializing the relationship payload into a JSON API format.`);\n }\n })(data === null || !!coerceId(data.id)) : {};\n if (data?.type === meta.type) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Missing Schema: Encountered a relationship identifier { type: '${data.type}', id: '${String(data.id)}' } for the '${identifier.type}.${meta.key}' ${meta.kind} relationship on <${identifier.type}:${String(identifier.id)}>, but no schema exists for that type.`);\n }\n })(store.schema.hasResource(data)) : {};\n } else {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Missing Schema: Encountered a relationship identifier with type '${data.type}' for the ${meta.kind} relationship '${meta.key}' on <${identifier.type}:${String(identifier.id)}>, Expected an identifier with type '${meta.type}'. No schema was found for '${data.type}'.`);\n }\n })(data === null || !data.type || store.schema.hasResource(data)) : {};\n }\n}\nconst RELATIONSHIP_KINDS = ['belongsTo', 'hasMany', 'resource', 'collection'];\nfunction isLegacyField(field) {\n return field.kind === 'belongsTo' || field.kind === 'hasMany';\n}\nfunction isRelationshipField(field) {\n return RELATIONSHIP_KINDS.includes(field.kind);\n}\nfunction temporaryConvertToLegacy(field) {\n return {\n kind: field.kind === 'resource' ? 'belongsTo' : 'hasMany',\n name: field.name,\n type: field.type,\n options: Object.assign({}, {\n async: false,\n inverse: null,\n resetOnRemoteUpdate: false\n }, field.options)\n };\n}\n\n/**\n *\n * Given RHS (Right Hand Side)\n *\n * ```ts\n * class User extends Model {\n * @hasMany('animal', { async: false, inverse: 'owner' }) pets;\n * }\n * ```\n *\n * Given LHS (Left Hand Side)\n *\n * ```ts\n * class Animal extends Model {\n * @belongsTo('user', { async: false, inverse: 'pets' }) owner;\n * }\n * ```\n *\n * The UpgradedMeta for the RHS would be:\n *\n * ```ts\n * {\n * kind: 'hasMany',\n * key: 'pets',\n * type: 'animal',\n * isAsync: false,\n * isImplicit: false,\n * isCollection: true,\n * isPolymorphic: false,\n * inverseKind: 'belongsTo',\n * inverseKey: 'owner',\n * inverseType: 'user',\n * inverseIsAsync: false,\n * inverseIsImplicit: false,\n * inverseIsCollection: false,\n * inverseIsPolymorphic: false,\n * }\n * ```\n *\n * The UpgradeMeta for the LHS would be:\n *\n * ```ts\n * {\n * kind: 'belongsTo',\n * key: 'owner',\n * type: 'user',\n * isAsync: false,\n * isImplicit: false,\n * isCollection: false,\n * isPolymorphic: false,\n * inverseKind: 'hasMany',\n * inverseKey: 'pets',\n * inverseType: 'animal',\n * inverseIsAsync: false,\n * inverseIsImplicit: false,\n * inverseIsCollection: true,\n * inverseIsPolymorphic: false,\n * }\n * ```\n *\n *\n * @class UpgradedMeta\n * @internal\n */\n\nconst BOOL_LATER = null;\nconst STR_LATER = '';\nconst IMPLICIT_KEY_RAND = Date.now();\nfunction implicitKeyFor(type, key) {\n return `implicit-${type}:${key}${IMPLICIT_KEY_RAND}`;\n}\nfunction syncMeta(definition, inverseDefinition) {\n definition.inverseKind = inverseDefinition.kind;\n definition.inverseKey = inverseDefinition.key;\n definition.inverseType = inverseDefinition.type;\n definition.inverseIsAsync = inverseDefinition.isAsync;\n definition.inverseIsCollection = inverseDefinition.isCollection;\n definition.inverseIsPolymorphic = inverseDefinition.isPolymorphic;\n definition.inverseIsImplicit = inverseDefinition.isImplicit;\n const resetOnRemoteUpdate = definition.resetOnRemoteUpdate === false || inverseDefinition.resetOnRemoteUpdate === false ? false : true;\n definition.resetOnRemoteUpdate = resetOnRemoteUpdate;\n inverseDefinition.resetOnRemoteUpdate = resetOnRemoteUpdate;\n}\nfunction upgradeMeta(meta) {\n if (!isLegacyField(meta)) {\n meta = temporaryConvertToLegacy(meta);\n }\n const niceMeta = {};\n const options = meta.options;\n niceMeta.kind = meta.kind;\n niceMeta.key = meta.name;\n niceMeta.type = meta.type;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected relationship definition to specify async`);\n }\n })(typeof options?.async === 'boolean') : {};\n niceMeta.isAsync = options.async;\n niceMeta.isImplicit = false;\n niceMeta.isCollection = meta.kind === 'hasMany';\n niceMeta.isPolymorphic = options && !!options.polymorphic;\n niceMeta.inverseKey = options && options.inverse || STR_LATER;\n niceMeta.inverseType = STR_LATER;\n niceMeta.inverseIsAsync = BOOL_LATER;\n niceMeta.inverseIsImplicit = options && options.inverse === null || BOOL_LATER;\n niceMeta.inverseIsCollection = BOOL_LATER;\n niceMeta.resetOnRemoteUpdate = isLegacyField(meta) ? meta.options?.resetOnRemoteUpdate === false ? false : true : false;\n return niceMeta;\n}\nfunction assertConfiguration(info, type, key) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n const isSelfReferential = info.isSelfReferential;\n if (isSelfReferential) {\n return true;\n }\n const _isRHS = key === info.rhs_relationshipName && (type === info.rhs_baseModelName ||\n // base or non-polymorphic\n // if the other side is polymorphic then we need to scan our modelNames\n info.lhs_isPolymorphic && info.rhs_modelNames.includes(type)); // polymorphic\n const _isLHS = key === info.lhs_relationshipName && (type === info.lhs_baseModelName ||\n // base or non-polymorphic\n // if the other side is polymorphic then we need to scan our modelNames\n info.rhs_isPolymorphic && info.lhs_modelNames.includes(type)); // polymorphic;\n\n if (!_isRHS && !_isLHS) {\n /*\n this occurs when we are likely polymorphic but not configured to be polymorphic\n most often due to extending a class that has a relationship definition on it.\n e.g.\n ```ts\n class Pet extends Model {\n @belongsTo('human', { async: false, inverse: 'pet' }) owner;\n }\n class Human extends Model {\n @belongsTo('pet', { async: false, inverse: 'owner' }) pet;\n }\n class Farmer extends Human {}\n ```\n In the above case, the following would trigger this error:\n ```ts\n let pet = store.createRecord('pet');\n let farmer = store.createRecord('farmer');\n farmer.pet = pet; // error\n ```\n The correct way to fix this is to specify the polymorphic option on Pet\n and to specify the abstract type 'human' on the Human base class.\n ```ts\n class Pet extends Model {\n @belongsTo('human', { async: false, inverse: 'pet', polymorphic: true }) owner;\n }\n class Human extends Model {\n @belongsTo('pet', { async: false, inverse: 'owner', as: 'human' }) pet;\n }\n class Farmer extends Human {}\n ```\n Alternatively both Human and Farmer could declare the relationship, because relationship\n definitions are \"structural\".\n ```ts\n class Pet extends Model {\n @belongsTo('human', { async: false, inverse: 'pet', polymorphic: true }) owner;\n }\n class Human extends Model {\n @belongsTo('pet', { async: false, inverse: 'owner', as: 'human' }) pet;\n }\n class Farmer extends Model {\n @belongsTo('pet', { async: false, inverse: 'owner', as: 'human' }) pet;\n }\n ```\n */\n if (key === info.lhs_relationshipName && info.lhs_modelNames.includes(type)) {\n // parentIdentifier, parentDefinition, addedIdentifier, store\n assertInheritedSchema(info.lhs_definition, type);\n } else if (key === info.rhs_relationshipName && info.rhs_modelNames.includes(type)) {\n assertInheritedSchema(info.lhs_definition, type);\n }\n // OPEN AN ISSUE :: we would like to improve our errors but need to understand what corner case got us here\n throw new Error(`PLEASE OPEN AN ISSUE :: Found a relationship that is neither the LHS nor RHS of the same edge. This is not supported. Please report this to the EmberData team.`);\n }\n if (_isRHS && _isLHS) {\n // not sure how we get here but it's probably the result of some form of inheritance\n // without having specified polymorphism correctly leading to it not being self-referential\n // OPEN AN ISSUE :: we would like to improve our errors but need to understand what corner case got us here\n throw new Error(`PLEASE OPEN AN ISSUE :: Found a relationship that is both the LHS and RHS of the same edge but is not self-referential. This is not supported. Please report this to the EmberData team.`);\n }\n }\n}\nfunction isLHS(info, type, key) {\n const isSelfReferential = info.isSelfReferential;\n const isRelationship = key === info.lhs_relationshipName;\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertConfiguration(info, type, key);\n }\n if (isRelationship === true) {\n return isSelfReferential === true ||\n // itself\n type === info.lhs_baseModelName ||\n // base or non-polymorphic\n // if the other side is polymorphic then we need to scan our modelNames\n info.rhs_isPolymorphic && info.lhs_modelNames.includes(type) // polymorphic\n ;\n }\n return false;\n}\nfunction upgradeDefinition(graph, identifier, propertyName, isImplicit = false) {\n const cache = graph._definitionCache;\n const storeWrapper = graph.store;\n const polymorphicLookup = graph._potentialPolymorphicTypes;\n const {\n type\n } = identifier;\n let cached = /*#__NOINLINE__*/expandingGet(cache, type, propertyName);\n\n // CASE: We have a cached resolution (null if no relationship exists)\n if (cached !== undefined) {\n return cached;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected to find relationship definition in the cache for the implicit relationship ${propertyName}`);\n }\n })(!isImplicit) : {};\n const relationships = storeWrapper.schema.fields(identifier);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected to have a relationship definition for ${type} but none was found.`);\n }\n })(relationships) : {};\n const meta = relationships.get(propertyName);\n if (!meta) {\n // TODO potentially we should just be permissive here since this is an implicit relationship\n // and not require the lookup table to be populated\n if (polymorphicLookup[type]) {\n const altTypes = Object.keys(polymorphicLookup[type]);\n for (let i = 0; i < altTypes.length; i++) {\n const _cached = expandingGet(cache, altTypes[i], propertyName);\n if (_cached) {\n /*#__NOINLINE__*/expandingSet(cache, type, propertyName, _cached);\n _cached.rhs_modelNames.push(type);\n return _cached;\n }\n }\n }\n\n // CASE: We don't have a relationship at all\n // we should only hit this in prod\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a relationship schema for '${type}.${propertyName}', but no relationship schema was found.`);\n }\n })(meta) : {};\n cache[type][propertyName] = null;\n return null;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected ${propertyName} to be a relationship`);\n }\n })(isRelationshipField(meta)) : {};\n const definition = /*#__NOINLINE__*/upgradeMeta(meta);\n let inverseDefinition;\n let inverseKey;\n const inverseType = definition.type;\n\n // CASE: Inverse is explicitly null\n if (definition.inverseKey === null) {\n // TODO probably dont need this assertion if polymorphic\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected the inverse model to exist`);\n }\n })(getStore(storeWrapper).modelFor(inverseType)) : {};\n inverseDefinition = null;\n } else {\n inverseKey = /*#__NOINLINE__*/inverseForRelationship(getStore(storeWrapper), identifier, propertyName);\n\n // CASE: If we are polymorphic, and we declared an inverse that is non-null\n // we must assume that the lack of inverseKey means that there is no\n // concrete type as the baseType, so we must construct and artificial\n // placeholder\n if (!inverseKey && definition.isPolymorphic && definition.inverseKey) {\n inverseDefinition = {\n kind: 'belongsTo',\n // this must be updated when we find the first belongsTo or hasMany definition that matches\n key: definition.inverseKey,\n type: type,\n isAsync: false,\n // this must be updated when we find the first belongsTo or hasMany definition that matches\n isImplicit: false,\n isCollection: false,\n // this must be updated when we find the first belongsTo or hasMany definition that matches\n isPolymorphic: false\n }; // the rest of the fields are populated by syncMeta\n\n // CASE: Inverse resolves to null\n } else if (!inverseKey) {\n inverseDefinition = null;\n } else {\n // CASE: We have an explicit inverse or were able to resolve one\n const inverseDefinitions = storeWrapper.schema.fields({\n type: inverseType\n });\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected to have a relationship definition for ${inverseType} but none was found.`);\n }\n })(inverseDefinitions) : {};\n const metaFromInverse = inverseDefinitions.get(inverseKey);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a relationship schema for '${inverseType}.${inverseKey}' to match the inverse of '${type}.${propertyName}', but no relationship schema was found.`);\n }\n })(metaFromInverse) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected ${inverseKey} to be a relationship`);\n }\n })(isRelationshipField(metaFromInverse)) : {};\n inverseDefinition = upgradeMeta(metaFromInverse);\n }\n }\n\n // CASE: We have no inverse\n if (!inverseDefinition) {\n // polish off meta\n inverseKey = /*#__NOINLINE__*/implicitKeyFor(type, propertyName);\n inverseDefinition = {\n kind: 'implicit',\n key: inverseKey,\n type: type,\n isAsync: false,\n isImplicit: true,\n isCollection: true,\n // with implicits any number of records could point at us\n isPolymorphic: false\n }; // the rest of the fields are populated by syncMeta\n\n syncMeta(definition, inverseDefinition);\n syncMeta(inverseDefinition, definition);\n const info = {\n lhs_key: `${type}:${propertyName}`,\n lhs_modelNames: [type],\n lhs_baseModelName: type,\n lhs_relationshipName: propertyName,\n lhs_definition: definition,\n lhs_isPolymorphic: definition.isPolymorphic,\n rhs_key: inverseDefinition.key,\n rhs_modelNames: [inverseType],\n rhs_baseModelName: inverseType,\n rhs_relationshipName: inverseDefinition.key,\n rhs_definition: inverseDefinition,\n rhs_isPolymorphic: false,\n hasInverse: false,\n isSelfReferential: type === inverseType,\n // this could be wrong if we are self-referential but also polymorphic\n isReflexive: false // we can't be reflexive if we don't define an inverse\n };\n expandingSet(cache, inverseType, inverseKey, info);\n expandingSet(cache, type, propertyName, info);\n return info;\n }\n\n // CASE: We do have an inverse\n const baseType = inverseDefinition.type;\n\n // TODO we want to assert this but this breaks all of our shoddily written tests\n /*\n if (DEBUG) {\n let inverseDoubleCheck = inverseFor(inverseRelationshipName, store);\n assert(`The ${inverseBaseModelName}:${inverseRelationshipName} relationship declares 'inverse: null', but it was resolved as the inverse for ${baseModelName}:${relationshipName}.`, inverseDoubleCheck);\n }\n */\n // CASE: We may have already discovered the inverse for the baseModelName\n // CASE: We have already discovered the inverse\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`We should have determined an inverseKey by now, open an issue if this is hit`);\n }\n })(typeof inverseKey === 'string' && inverseKey.length > 0) : {};\n cached = expandingGet(cache, baseType, propertyName) || expandingGet(cache, inverseType, inverseKey);\n if (cached) {\n // TODO this assert can be removed if the above assert is enabled\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`The ${inverseType}:${inverseKey} relationship declares 'inverse: null', but it was resolved as the inverse for ${type}:${propertyName}.`);\n }\n })(cached.hasInverse !== false) : {};\n const _isLHS = cached.lhs_baseModelName === baseType;\n const modelNames = _isLHS ? cached.lhs_modelNames : cached.rhs_modelNames;\n // make this lookup easier in the future by caching the key\n modelNames.push(type);\n expandingSet(cache, type, propertyName, cached);\n return cached;\n }\n\n // this is our first time so polish off the metas\n syncMeta(definition, inverseDefinition);\n syncMeta(inverseDefinition, definition);\n const lhs_modelNames = [type];\n if (type !== baseType) {\n lhs_modelNames.push(baseType);\n }\n const isSelfReferential = baseType === inverseType;\n const info = {\n lhs_key: `${baseType}:${propertyName}`,\n lhs_modelNames,\n lhs_baseModelName: baseType,\n lhs_relationshipName: propertyName,\n lhs_definition: definition,\n lhs_isPolymorphic: definition.isPolymorphic,\n rhs_key: `${inverseType}:${inverseKey}`,\n rhs_modelNames: [inverseType],\n rhs_baseModelName: inverseType,\n rhs_relationshipName: inverseKey,\n rhs_definition: inverseDefinition,\n rhs_isPolymorphic: inverseDefinition.isPolymorphic,\n hasInverse: true,\n isSelfReferential,\n isReflexive: isSelfReferential && propertyName === inverseKey\n };\n\n // Create entries for the baseModelName as well as modelName to speed up\n // inverse lookups\n expandingSet(cache, baseType, propertyName, info);\n expandingSet(cache, type, propertyName, info);\n\n // Greedily populate the inverse\n expandingSet(cache, inverseType, inverseKey, info);\n return info;\n}\nfunction inverseForRelationship(store, identifier, key) {\n const definition = store.schema.fields(identifier).get(key);\n if (!definition) {\n return null;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected ${key} to be a relationship`);\n }\n })(isRelationshipField(definition)) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected the relationship defintion to specify the inverse type or null.`);\n }\n })(definition.options?.inverse === null || typeof definition.options?.inverse === 'string' && definition.options.inverse.length > 0) : {};\n return definition.options.inverse;\n}\n\n/* eslint-disable no-inner-declarations, @typescript-eslint/no-shadow */\n\nlet assertPolymorphicType;\nlet assertInheritedSchema;\nif (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n function validateSchema(definition, meta) {\n const errors = new Map();\n if (definition.inverseKey !== meta.name) {\n errors.set('name', ` <---- should be '${definition.inverseKey}'`);\n }\n if (definition.inverseType !== meta.type) {\n errors.set('type', ` <---- should be '${definition.inverseType}'`);\n }\n if (definition.inverseKind !== meta.kind) {\n errors.set('type', ` <---- should be '${definition.inverseKind}'`);\n }\n if (definition.inverseIsAsync !== meta.options.async) {\n errors.set('async', ` <---- should be ${definition.inverseIsAsync}`);\n }\n if (definition.inverseIsPolymorphic && definition.inverseIsPolymorphic !== meta.options.polymorphic) {\n errors.set('polymorphic', ` <---- should be ${definition.inverseIsPolymorphic}`);\n }\n if (definition.key !== meta.options.inverse) {\n errors.set('inverse', ` <---- should be '${definition.key}'`);\n }\n if (definition.type !== meta.options.as) {\n errors.set('as', ` <---- should be '${definition.type}'`);\n }\n return errors;\n }\n function expectedSchema(definition) {\n return printSchema({\n name: definition.inverseKey,\n type: definition.inverseType,\n kind: definition.inverseKind,\n options: {\n as: definition.type,\n async: definition.inverseIsAsync,\n polymorphic: definition.inverseIsPolymorphic || false,\n inverse: definition.key\n }\n });\n }\n function printSchema(config, errors) {\n return `\n\n\\`\\`\\`\n{\n ${config.name}: {\n name: '${config.name}',${errors?.get('name') || ''}\n type: '${config.type}',${errors?.get('type') || ''}\n kind: '${config.kind}',${errors?.get('kind') || ''}\n options: {\n as: '${config.options.as}',${errors?.get('as') || ''}\n async: ${config.options.async},${errors?.get('async') || ''}\n polymorphic: ${config.options.polymorphic},${errors?.get('polymorphic') || ''}\n inverse: '${config.options.inverse}'${errors?.get('inverse') || ''}\n }\n }\n}\n\\`\\`\\`\n\n`;\n }\n function metaFrom(definition) {\n return {\n name: definition.key,\n type: definition.type,\n kind: definition.kind,\n options: {\n async: definition.isAsync,\n polymorphic: definition.isPolymorphic,\n inverse: definition.inverseKey\n }\n };\n }\n function inverseMetaFrom(definition) {\n return {\n name: definition.inverseKey,\n type: definition.inverseType,\n kind: definition.inverseKind,\n options: {\n as: definition.isPolymorphic ? definition.type : undefined,\n async: definition.inverseIsAsync,\n polymorphic: definition.inverseIsPolymorphic,\n inverse: definition.key\n }\n };\n }\n function inverseDefinition(definition) {\n return {\n key: definition.inverseKey,\n type: definition.inverseType,\n kind: definition.inverseKind,\n isAsync: definition.inverseIsAsync,\n isPolymorphic: true,\n isCollection: definition.inverseIsCollection,\n isImplicit: definition.inverseIsImplicit,\n inverseKey: definition.key,\n inverseType: definition.type,\n inverseKind: definition.kind,\n inverseIsAsync: definition.isAsync,\n inverseIsPolymorphic: definition.isPolymorphic,\n inverseIsImplicit: definition.isImplicit,\n inverseIsCollection: definition.isCollection,\n resetOnRemoteUpdate: definition.resetOnRemoteUpdate\n };\n }\n function definitionWithPolymorphic(definition) {\n return Object.assign({}, definition, {\n inverseIsPolymorphic: true\n });\n }\n assertInheritedSchema = function assertInheritedSchema(definition, type) {\n const meta1 = metaFrom(definition);\n const meta2 = inverseMetaFrom(definition);\n const errors1 = validateSchema(inverseDefinition(definition), meta1);\n const errors2 = validateSchema(definitionWithPolymorphic(definition), meta2);\n if (errors2.size === 0 && errors1.size > 0) {\n throw new Error(`The schema for the relationship '${type}.${definition.key}' is not configured to satisfy '${definition.inverseType}' and thus cannot utilize the '${definition.inverseType}.${definition.key}' relationship to connect with '${definition.type}.${definition.inverseKey}'\\n\\nIf using this relationship in a polymorphic manner is desired, the relationships schema definition for '${type}' should include:${printSchema(meta1, errors1)}`);\n } else if (errors1.size > 0) {\n throw new Error(`The schema for the relationship '${type}.${definition.key}' is not configured to satisfy '${definition.inverseType}' and thus cannot utilize the '${definition.inverseType}.${definition.key}' relationship to connect with '${definition.type}.${definition.inverseKey}'\\n\\nIf using this relationship in a polymorphic manner is desired, the relationships schema definition for '${type}' should include:${printSchema(meta1, errors1)} and the relationships schema definition for '${definition.type}' should include:${printSchema(meta2, errors2)}`);\n } else if (errors2.size > 0) {\n throw new Error(`The schema for the relationship '${type}.${definition.key}' satisfies '${definition.inverseType}' but cannot utilize the '${definition.inverseType}.${definition.key}' relationship to connect with '${definition.type}.${definition.inverseKey}' because that relationship is not polymorphic.\\n\\nIf using this relationship in a polymorphic manner is desired, the relationships schema definition for '${definition.type}' should include:${printSchema(meta2, errors2)}`);\n }\n };\n assertPolymorphicType = function assertPolymorphicType(parentIdentifier, parentDefinition, addedIdentifier, store) {\n if (parentDefinition.inverseIsImplicit) {\n return;\n }\n if (parentDefinition.isPolymorphic) {\n let meta = store.schema.fields(addedIdentifier).get(parentDefinition.inverseKey);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`No '${parentDefinition.inverseKey}' field exists on '${addedIdentifier.type}'. To use this type in the polymorphic relationship '${parentDefinition.inverseType}.${parentDefinition.key}' the relationships schema definition for ${addedIdentifier.type} should include:${expectedSchema(parentDefinition)}`);\n }\n })(meta) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected the field ${parentDefinition.inverseKey} to be a relationship`);\n }\n })(meta && isRelationshipField(meta)) : {};\n meta = isLegacyField(meta) ? meta : temporaryConvertToLegacy(meta);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You should not specify both options.as and options.inverse as null on ${addedIdentifier.type}.${parentDefinition.inverseKey}, as if there is no inverse field there is no abstract type to conform to. You may have intended for this relationship to be polymorphic, or you may have mistakenly set inverse to null.`);\n }\n })(!(meta.options.inverse === null && meta?.options.as?.length)) : {};\n const errors = validateSchema(parentDefinition, meta);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`The schema for the relationship '${parentDefinition.inverseKey}' on '${addedIdentifier.type}' type does not correctly implement '${parentDefinition.type}' and thus cannot be assigned to the '${parentDefinition.key}' relationship in '${parentIdentifier.type}'. If using this record in this polymorphic relationship is desired, correct the errors in the schema shown below:${printSchema(meta, errors)}`);\n }\n })(errors.size === 0) : {};\n } else if (addedIdentifier.type !== parentDefinition.type) {\n // if we are not polymorphic\n // then the addedIdentifier.type must be the same as the parentDefinition.type\n let meta = store.schema.fields(addedIdentifier).get(parentDefinition.inverseKey);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected the field ${parentDefinition.inverseKey} to be a relationship`);\n }\n })(!meta || isRelationshipField(meta)) : {};\n meta = meta && (isLegacyField(meta) ? meta : temporaryConvertToLegacy(meta));\n if (meta?.options.as === parentDefinition.type) {\n // inverse is likely polymorphic but missing the polymorphic flag\n let meta = store.schema.fields({\n type: parentDefinition.inverseType\n }).get(parentDefinition.key);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected the field ${parentDefinition.key} to be a relationship`);\n }\n })(meta && isRelationshipField(meta)) : {};\n meta = isLegacyField(meta) ? meta : temporaryConvertToLegacy(meta);\n const errors = validateSchema(definitionWithPolymorphic(inverseDefinition(parentDefinition)), meta);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`The '<${addedIdentifier.type}>.${parentDefinition.inverseKey}' relationship cannot be used polymorphically because '<${parentDefinition.inverseType}>.${parentDefinition.key} is not a polymorphic relationship. To use this relationship in a polymorphic manner, fix the following schema issues on the relationships schema for '${parentDefinition.inverseType}':${printSchema(meta, errors)}`);\n }\n })() : {};\n } else {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`The '${addedIdentifier.type}' type does not implement '${parentDefinition.type}' and thus cannot be assigned to the '${parentDefinition.key}' relationship in '${parentIdentifier.type}'. If this relationship should be polymorphic, mark ${parentDefinition.inverseType}.${parentDefinition.key} as \\`polymorphic: true\\` and ${addedIdentifier.type}.${parentDefinition.inverseKey} as implementing it via \\`as: '${parentDefinition.type}'\\`.`);\n }\n })() : {};\n }\n }\n };\n}\n\n/*\n case many:1\n ========\n In a bi-directional graph with Many:1 edges, adding a value\n results in up-to 3 discrete value transitions, while removing\n a value is only 2 transitions.\n\n For adding C to A\n If: A <<-> B, C <->> D is the initial state,\n and: B <->> A <<-> C, D is the final state\n\n then we would undergo the following transitions.\n\n add C to A\n remove C from D\n add A to C\n\n For removing B from A\n If: A <<-> B, C <->> D is the initial state,\n and: A, B, C <->> D is the final state\n\n then we would undergo the following transitions.\n\n remove B from A\n remove A from B\n\n case many:many\n ===========\n In a bi-directional graph with Many:Many edges, adding or\n removing a value requires only 2 value transitions.\n\n For Adding\n If: A<<->>B, C<<->>D is the initial state (double arrows representing the many side)\n And: D<<->>C<<->>A<<->>B is the final state\n\n Then we would undergo two transitions.\n\n add C to A.\n add A to C\n\n For Removing\n If: A<<->>B, C<<->>D is the initial state (double arrows representing the many side)\n And: A, B, C<<->>D is the final state\n\n Then we would undergo two transitions.\n\n remove B from A\n remove A from B\n\n case many:?\n ========\n In a uni-directional graph with Many:? edges (modeled in EmberData with `inverse:null`) with\n artificial (implicit) inverses, replacing a value results in 2 discrete value transitions.\n This is because a Many:? relationship is effectively Many:Many.\n */\nfunction replaceRelatedRecords(graph, op, isRemote) {\n if (isRemote) {\n replaceRelatedRecordsRemote(graph, op, isRemote);\n } else {\n replaceRelatedRecordsLocal(graph, op, isRemote);\n }\n}\nfunction replaceRelatedRecordsLocal(graph, op, isRemote) {\n const identifiers = op.value;\n const relationship = graph.get(op.record, op.field);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected hasMany relationship`);\n }\n })(isHasMany(relationship)) : {};\n\n // relationships for newly created records begin in the dirty state, so if updated\n // before flushed we would fail to notify. This check helps us avoid that.\n const isMaybeFirstUpdate = relationship.remoteState.length === 0 && relationship.localState === null && relationship.state.hasReceivedData === false;\n relationship.state.hasReceivedData = true;\n const {\n additions,\n removals\n } = relationship;\n const {\n inverseKey,\n type\n } = relationship.definition;\n const {\n record\n } = op;\n const wasDirty = relationship.isDirty;\n relationship.isDirty = false;\n const onAdd = identifier => {\n // Since we are diffing against the remote state, we check\n // if our previous local state did not contain this identifier\n const removalsHas = removals?.has(identifier);\n if (removalsHas || !additions?.has(identifier)) {\n if (type !== identifier.type) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertPolymorphicType(relationship.identifier, relationship.definition, identifier, graph.store);\n }\n graph.registerPolymorphicType(type, identifier.type);\n }\n relationship.isDirty = true;\n addToInverse(graph, identifier, inverseKey, op.record, isRemote);\n if (removalsHas) {\n removals.delete(identifier);\n }\n }\n };\n const onRemove = identifier => {\n // Since we are diffing against the remote state, we check\n // if our previous local state had contained this identifier\n const additionsHas = additions?.has(identifier);\n if (additionsHas || !removals?.has(identifier)) {\n relationship.isDirty = true;\n removeFromInverse(graph, identifier, inverseKey, record, isRemote);\n if (additionsHas) {\n additions.delete(identifier);\n }\n }\n };\n const diff = diffCollection(identifiers, relationship, onAdd, onRemove);\n // eslint-disable-next-line @typescript-eslint/no-unused-vars\n relationship.isDirty || diff.changed;\n\n // any additions no longer in the local state\n // need to be removed from the inverse\n if (additions && additions.size > 0) {\n additions.forEach(identifier => {\n if (!diff.add.has(identifier)) {\n onRemove(identifier);\n }\n });\n }\n\n // any removals no longer in the local state\n // need to be added back to the inverse\n if (removals && removals.size > 0) {\n removals.forEach(identifier => {\n if (!diff.del.has(identifier)) {\n onAdd(identifier);\n }\n });\n }\n relationship.additions = diff.add;\n relationship.removals = diff.del;\n relationship.localState = diff.finalState;\n relationship.isDirty = wasDirty;\n if (isMaybeFirstUpdate || !wasDirty /*&& becameDirty // TODO to guard like this we need to detect reorder when diffing local */) {\n notifyChange(graph, op.record, op.field);\n }\n}\nfunction replaceRelatedRecordsRemote(graph, op, isRemote) {\n const identifiers = op.value;\n const relationship = graph.get(op.record, op.field);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You can only '${op.op}' on a hasMany relationship. ${op.record.type}.${op.field} is a ${relationship.definition.kind}`);\n }\n })(isHasMany(relationship)) : {};\n if (isRemote) {\n graph._addToTransaction(relationship);\n }\n relationship.state.hasReceivedData = true;\n\n // cache existing state\n const {\n definition\n } = relationship;\n const {\n type\n } = relationship.definition;\n const diff = diffCollection(identifiers, relationship, identifier => {\n if (type !== identifier.type) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertPolymorphicType(relationship.identifier, relationship.definition, identifier, graph.store);\n }\n graph.registerPolymorphicType(type, identifier.type);\n }\n // commit additions\n // TODO build this into the diff?\n // because we are not dirty if this was a committed local addition\n if (relationship.additions?.has(identifier)) {\n relationship.additions.delete(identifier);\n } else {\n relationship.isDirty = true;\n }\n addToInverse(graph, identifier, definition.inverseKey, op.record, isRemote);\n }, identifier => {\n // commit removals\n // TODO build this into the diff?\n // because we are not dirty if this was a committed local addition\n if (relationship.removals?.has(identifier)) {\n relationship.removals.delete(identifier);\n } else {\n relationship.isDirty = true;\n }\n removeFromInverse(graph, identifier, definition.inverseKey, op.record, isRemote);\n });\n\n // replace existing state\n relationship.remoteMembers = diff.finalSet;\n relationship.remoteState = diff.finalState;\n\n // changed also indicates a change in order\n if (diff.changed) {\n relationship.isDirty = true;\n }\n\n // TODO unsure if we need this but it\n // may allow us to more efficiently patch\n // the associated ManyArray\n relationship._diff = diff;\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_RELATIONSHIP_REMOTE_UPDATE_CLEARING_LOCAL_STATE)) {\n // only do this for legacy hasMany, not collection\n // and provide a way to incrementally migrate\n if (relationship.definition.kind === 'hasMany' && relationship.definition.resetOnRemoteUpdate !== false) {\n const deprecationInfo = {\n removals: [],\n additions: [],\n triggered: false\n };\n if (relationship.removals) {\n relationship.isDirty = true;\n relationship.removals.forEach(identifier => {\n deprecationInfo.triggered = true;\n deprecationInfo.removals.push(identifier);\n // reverse the removal\n // if we are still in removals at this point then\n // we were not \"committed\" which means we are present\n // in the remoteMembers. So we \"add back\" on the inverse.\n addToInverse(graph, identifier, definition.inverseKey, op.record, isRemote);\n });\n relationship.removals = null;\n }\n if (relationship.additions) {\n relationship.additions.forEach(identifier => {\n // reverse the addition\n // if we are still in additions at this point then\n // we were not \"committed\" which means we are not present\n // in the remoteMembers. So we \"remove\" from the inverse.\n // however we only do this if we are not a \"new\" record.\n if (!isNew(identifier)) {\n deprecationInfo.triggered = true;\n deprecationInfo.additions.push(identifier);\n relationship.isDirty = true;\n relationship.additions.delete(identifier);\n removeFromInverse(graph, identifier, definition.inverseKey, op.record, isRemote);\n }\n });\n if (relationship.additions.size === 0) {\n relationship.additions = null;\n }\n }\n if (deprecationInfo.triggered) {\n deprecate(`EmberData is changing the default semantics of updates to the remote state of relationships.\\n\\nThe following local state was cleared from the <${relationship.identifier.type}>.${relationship.definition.key} hasMany relationship but will not be once this deprecation is resolved by opting into the new behavior:\\n\\n\\tAdded: [${deprecationInfo.additions.map(i => i.lid).join(', ')}]\\n\\tRemoved: [${deprecationInfo.removals.map(i => i.lid).join(', ')}]`, false, {\n id: 'ember-data:deprecate-relationship-remote-update-clearing-local-state',\n for: 'ember-data',\n since: {\n enabled: '5.3',\n available: '5.3'\n },\n until: '6.0',\n url: 'https://deprecations.emberjs.com/v5.x#ember-data-deprecate-relationship-remote-update-clearing-local-state'\n });\n }\n }\n }\n if (relationship.isDirty) {\n flushCanonical(graph, relationship);\n }\n}\nfunction addToInverse(graph, identifier, key, value, isRemote) {\n const relationship = graph.get(identifier, key);\n const {\n type\n } = relationship.definition;\n if (type !== value.type) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertPolymorphicType(relationship.identifier, relationship.definition, value, graph.store);\n }\n graph.registerPolymorphicType(type, value.type);\n }\n if (isBelongsTo(relationship)) {\n relationship.state.hasReceivedData = true;\n relationship.state.isEmpty = false;\n if (isRemote) {\n graph._addToTransaction(relationship);\n if (relationship.remoteState !== null) {\n removeFromInverse(graph, relationship.remoteState, relationship.definition.inverseKey, identifier, isRemote);\n }\n relationship.remoteState = value;\n }\n if (relationship.localState !== value) {\n if (!isRemote && relationship.localState) {\n removeFromInverse(graph, relationship.localState, relationship.definition.inverseKey, identifier, isRemote);\n }\n relationship.localState = value;\n notifyChange(graph, identifier, key);\n }\n } else if (isHasMany(relationship)) {\n if (isRemote) {\n // TODO this needs to alert stuffs\n // And patch state better\n // This is almost definitely wrong\n // WARNING WARNING WARNING\n\n if (!relationship.remoteMembers.has(value)) {\n graph._addToTransaction(relationship);\n relationship.remoteState.push(value);\n relationship.remoteMembers.add(value);\n if (relationship.additions?.has(value)) {\n relationship.additions.delete(value);\n } else {\n relationship.isDirty = true;\n relationship.state.hasReceivedData = true;\n flushCanonical(graph, relationship);\n }\n }\n } else {\n if (_addLocal(graph, identifier, relationship, value, null)) {\n notifyChange(graph, identifier, key);\n }\n }\n } else {\n if (isRemote) {\n if (!relationship.remoteMembers.has(value)) {\n relationship.remoteMembers.add(value);\n relationship.localMembers.add(value);\n }\n } else {\n if (!relationship.localMembers.has(value)) {\n relationship.localMembers.add(value);\n }\n }\n }\n}\nfunction notifyInverseOfPotentialMaterialization(graph, identifier, key, value, isRemote) {\n const relationship = graph.get(identifier, key);\n if (isHasMany(relationship) && isRemote && relationship.remoteMembers.has(value)) {\n notifyChange(graph, identifier, key);\n }\n}\nfunction removeFromInverse(graph, identifier, key, value, isRemote) {\n const relationship = graph.get(identifier, key);\n if (isBelongsTo(relationship)) {\n relationship.state.isEmpty = true;\n if (isRemote) {\n graph._addToTransaction(relationship);\n relationship.remoteState = null;\n }\n if (relationship.localState === value) {\n relationship.localState = null;\n notifyChange(graph, identifier, key);\n }\n } else if (isHasMany(relationship)) {\n if (isRemote) {\n graph._addToTransaction(relationship);\n if (_removeRemote(relationship, value)) {\n notifyChange(graph, identifier, key);\n }\n } else {\n if (_removeLocal(relationship, value)) {\n notifyChange(graph, identifier, key);\n }\n }\n } else {\n if (isRemote) {\n relationship.remoteMembers.delete(value);\n relationship.localMembers.delete(value);\n } else {\n if (value && relationship.localMembers.has(value)) {\n relationship.localMembers.delete(value);\n }\n }\n }\n}\nfunction flushCanonical(graph, rel) {\n graph._scheduleLocalSync(rel);\n}\nfunction replaceRelatedRecord(graph, op, isRemote = false) {\n const relationship = graph.get(op.record, op.field);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You can only '${op.op}' on a belongsTo relationship. ${op.record.type}.${op.field} is a ${relationship.definition.kind}`);\n }\n })(isBelongsTo(relationship)) : {};\n if (isRemote) {\n graph._addToTransaction(relationship);\n }\n const {\n definition,\n state\n } = relationship;\n const prop = isRemote ? 'remoteState' : 'localState';\n const existingState = relationship[prop];\n\n /*\n case 1:1\n ========\n In a bi-directional graph with 1:1 edges, replacing a value\n results in up-to 4 discrete value transitions.\n If: A <-> B, C <-> D is the initial state,\n and: A <-> C, B, D is the final state\n then we would undergo the following 4 transitions.\n remove A from B\n add C to A\n remove C from D\n add A to C\n case 1:many\n ===========\n In a bi-directional graph with 1:Many edges, replacing a value\n results in up-to 3 discrete value transitions.\n If: A<->>B<<->D, C<<->D is the initial state (double arrows representing the many side)\n And: A<->>C<<->D, B<<->D is the final state\n Then we would undergo three transitions.\n remove A from B\n add C to A.\n add A to C\n case 1:?\n ========\n In a uni-directional graph with 1:? edges (modeled in EmberData with `inverse:null`) with\n artificial (implicit) inverses, replacing a value results in up-to 3 discrete value transitions.\n This is because a 1:? relationship is effectively 1:many.\n If: A->B, C->B is the initial state\n And: A->C, C->B is the final state\n Then we would undergo three transitions.\n Remove A from B\n Add C to A\n Add A to C\n */\n\n // nothing for us to do\n if (op.value === existingState) {\n // if we were empty before but now know we are empty this needs to be true\n state.hasReceivedData = true;\n // if this is a remote update we still sync\n if (isRemote) {\n const {\n localState\n } = relationship;\n // don't sync if localState is a new record and our remoteState is null\n if (localState && isNew(localState) && !existingState) {\n return;\n }\n if (existingState && localState === existingState) {\n notifyInverseOfPotentialMaterialization(graph, existingState, definition.inverseKey, op.record, isRemote);\n } else if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_RELATIONSHIP_REMOTE_UPDATE_CLEARING_LOCAL_STATE)) {\n // if localState does not match existingState then we know\n // we have a local mutation that has not been persisted yet\n if (localState !== op.value && relationship.definition.resetOnRemoteUpdate !== false) {\n relationship.localState = existingState;\n deprecate(`EmberData is changing the default semantics of updates to the remote state of relationships.\\n\\nThe following local state was cleared from the <${relationship.identifier.type}>.${relationship.definition.key} belongsTo relationship but will not be once this deprecation is resolved:\\n\\n\\t${localState ? 'Added: ' + localState.lid + '\\n\\t' : ''}${existingState ? 'Removed: ' + existingState.lid : ''}`, false, {\n id: 'ember-data:deprecate-relationship-remote-update-clearing-local-state',\n for: 'ember-data',\n since: {\n enabled: '5.3',\n available: '5.3'\n },\n until: '6.0',\n url: 'https://deprecations.emberjs.com/v5.x#ember-data-deprecate-relationship-remote-update-clearing-local-state'\n });\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n }\n }\n }\n return;\n }\n\n // remove this value from the inverse if required\n if (existingState) {\n removeFromInverse(graph, existingState, definition.inverseKey, op.record, isRemote);\n }\n\n // update value to the new value\n relationship[prop] = op.value;\n state.hasReceivedData = true;\n state.isEmpty = op.value === null;\n state.isStale = false;\n state.hasFailedLoadAttempt = false;\n if (op.value) {\n if (definition.type !== op.value.type) {\n // assert(\n // `The '<${definition.inverseType}>.${op.field}' relationship expects only '${definition.type}' records since it is not polymorphic. Received a Record of type '${op.value.type}'`,\n // definition.isPolymorphic\n // );\n\n // TODO this should now handle the deprecation warning if isPolymorphic is not set\n // but the record does turn out to be polymorphic\n // this should still assert if the user is relying on legacy inheritance/mixins to\n // provide polymorphic behavior and has not yet added the polymorphic flags\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertPolymorphicType(relationship.identifier, definition, op.value, graph.store);\n }\n graph.registerPolymorphicType(definition.type, op.value.type);\n }\n addToInverse(graph, op.value, definition.inverseKey, op.record, isRemote);\n }\n if (isRemote) {\n const {\n localState,\n remoteState\n } = relationship;\n if (localState && isNew(localState) && !remoteState) {\n return;\n }\n // when localState does not match the new remoteState and\n // localState === existingState then we had no local mutation\n // and we can safely sync the new remoteState to local\n if (localState !== remoteState && localState === existingState) {\n relationship.localState = remoteState;\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n // But when localState does not match the new remoteState and\n // and localState !== existingState then we know we have a local mutation\n // that has not been persisted yet.\n } else if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_RELATIONSHIP_REMOTE_UPDATE_CLEARING_LOCAL_STATE)) {\n if (localState !== remoteState && localState !== existingState && relationship.definition.resetOnRemoteUpdate !== false) {\n relationship.localState = remoteState;\n deprecate(`EmberData is changing the default semantics of updates to the remote state of relationships.\\n\\nThe following local state was cleared from the <${relationship.identifier.type}>.${relationship.definition.key} belongsTo relationship but will not be once this deprecation is resolved:\\n\\n\\t${localState ? 'Added: ' + localState.lid + '\\n\\t' : ''}${existingState ? 'Removed: ' + existingState.lid : ''}`, false, {\n id: 'ember-data:deprecate-relationship-remote-update-clearing-local-state',\n for: 'ember-data',\n since: {\n enabled: '5.3',\n available: '5.3'\n },\n until: '6.0',\n url: 'https://deprecations.emberjs.com/v5.x#ember-data-deprecate-relationship-remote-update-clearing-local-state'\n });\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n }\n }\n } else {\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n }\n}\nfunction _deprecatedCompare(newState, newMembers, prevState, prevSet, onAdd, onDel) {\n const newLength = newState.length;\n const prevLength = prevState.length;\n const iterationLength = Math.max(newLength, prevLength);\n let changed = newMembers.size !== prevSet.size;\n const added = new Set();\n const removed = new Set();\n const duplicates = new Map();\n const finalSet = new Set();\n const finalState = [];\n for (let i = 0, j = 0; i < iterationLength; i++) {\n let adv = false;\n let member;\n\n // accumulate anything added\n if (i < newLength) {\n member = newState[i];\n if (!finalSet.has(member)) {\n finalState[j] = member;\n finalSet.add(member);\n adv = true;\n if (!prevSet.has(member)) {\n changed = true;\n added.add(member);\n onAdd(member);\n }\n } else {\n let list = duplicates.get(member);\n if (list === undefined) {\n list = [];\n duplicates.set(member, list);\n }\n list.push(i);\n }\n }\n\n // accumulate anything removed\n if (i < prevLength) {\n const prevMember = prevState[i];\n\n // detect reordering, adjusting index for duplicates\n // j is always less than i and so if i < prevLength, j < prevLength\n if (member !== prevState[j]) {\n changed = true;\n }\n if (!newMembers.has(prevMember)) {\n changed = true;\n removed.add(prevMember);\n onDel(prevMember);\n }\n } else if (adv && j < prevLength && member !== prevState[j]) {\n changed = true;\n }\n if (adv) {\n j++;\n }\n }\n const diff = {\n add: added,\n del: removed,\n finalState,\n finalSet,\n changed\n };\n return {\n diff,\n duplicates\n };\n}\nfunction _compare(finalState, finalSet, prevState, prevSet, onAdd, onDel) {\n const finalLength = finalState.length;\n const prevLength = prevState.length;\n const iterationLength = Math.max(finalLength, prevLength);\n const equalLength = finalLength === prevLength;\n let changed = finalSet.size !== prevSet.size;\n const added = new Set();\n const removed = new Set();\n for (let i = 0; i < iterationLength; i++) {\n let member;\n\n // accumulate anything added\n if (i < finalLength) {\n member = finalState[i];\n if (!prevSet.has(member)) {\n changed = true;\n added.add(member);\n onAdd(member);\n }\n }\n\n // accumulate anything removed\n if (i < prevLength) {\n const prevMember = prevState[i];\n\n // detect reordering\n if (equalLength && member !== prevMember) {\n changed = true;\n }\n if (!finalSet.has(prevMember)) {\n changed = true;\n removed.add(prevMember);\n onDel(prevMember);\n }\n }\n }\n return {\n add: added,\n del: removed,\n finalState,\n finalSet,\n changed\n };\n}\nfunction diffCollection(finalState, relationship, onAdd, onDel) {\n const finalSet = new Set(finalState);\n const {\n remoteState,\n remoteMembers\n } = relationship;\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_NON_UNIQUE_PAYLOADS)) {\n if (finalState.length !== finalSet.size) {\n const {\n diff,\n duplicates\n } = _deprecatedCompare(finalState, finalSet, remoteState, remoteMembers, onAdd, onDel);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n deprecate(`Expected all entries in the relationship ${relationship.definition.type}:${relationship.definition.key} to be unique, see log for a list of duplicate entry indeces`, false, {\n id: 'ember-data:deprecate-non-unique-relationship-entries',\n for: 'ember-data',\n until: '6.0',\n since: {\n available: '5.3',\n enabled: '5.3'\n }\n });\n // eslint-disable-next-line no-console\n console.log(duplicates);\n }\n return diff;\n }\n } else {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected all entries in the relationship to be unique, found duplicates`);\n }\n })(finalState.length === finalSet.size) : {};\n }\n return _compare(finalState, finalSet, remoteState, remoteMembers, onAdd, onDel);\n}\nfunction computeLocalState(storage) {\n if (!storage.isDirty) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected localState to be present`);\n }\n })(Array.isArray(storage.localState)) : {};\n return storage.localState;\n }\n const state = storage.remoteState.slice();\n storage.removals?.forEach(v => {\n const index = state.indexOf(v);\n state.splice(index, 1);\n });\n storage.additions?.forEach(v => {\n state.push(v);\n });\n storage.localState = state;\n storage.isDirty = false;\n return state;\n}\nfunction _addLocal(graph, record, relationship, value, index) {\n const {\n remoteMembers,\n removals\n } = relationship;\n let additions = relationship.additions;\n const hasPresence = remoteMembers.has(value) || additions?.has(value);\n if (hasPresence && !removals?.has(value)) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Attempted to add the resource '${value.lid}' to the collection <${relationship.identifier.type}>.${relationship.definition.key} it was already in`);\n }\n })(hasPresence && !removals?.has(value)) : {};\n return false;\n }\n if (removals?.has(value)) {\n removals.delete(value);\n } else {\n if (!additions) {\n additions = relationship.additions = new Set();\n }\n relationship.state.hasReceivedData = true;\n additions.add(value);\n const {\n type\n } = relationship.definition;\n if (type !== value.type) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertPolymorphicType(record, relationship.definition, value, graph.store);\n }\n graph.registerPolymorphicType(value.type, type);\n }\n }\n\n // if we have existing localState\n // and we have an index\n // apply the change, as this is more efficient\n // than recomputing localState and\n // it allows us to preserve local ordering\n // to a small extend. Local ordering should not\n // be relied upon as any remote change will blow it away\n if (relationship.localState) {\n if (index !== null) {\n relationship.localState.splice(index, 0, value);\n } else {\n relationship.localState.push(value);\n }\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected relationship to be dirty when adding a local mutation`);\n }\n })(relationship.localState || relationship.isDirty) : {};\n return true;\n}\nfunction _removeLocal(relationship, value) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected an identifier to remove from the collection relationship`);\n }\n })(value) : {};\n const {\n remoteMembers,\n additions\n } = relationship;\n let removals = relationship.removals;\n const hasPresence = remoteMembers.has(value) || additions?.has(value);\n if (!hasPresence || removals?.has(value)) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Attempted to remove the resource '${value.lid}' from the collection <${relationship.identifier.type}>.${relationship.definition.key} but it was not present`);\n }\n })(!hasPresence || removals?.has(value)) : {};\n return false;\n }\n if (additions?.has(value)) {\n additions.delete(value);\n } else {\n if (!removals) {\n removals = relationship.removals = new Set();\n }\n removals.add(value);\n }\n\n // if we have existing localState\n // apply the change, as this is more efficient\n // than recomputing localState and\n // it allows us to preserve local ordering\n // to a small extend. Local ordering should not\n // be relied upon as any remote change will blow it away\n if (relationship.localState) {\n const index = relationship.localState.indexOf(value);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot remove a resource that is not present`);\n }\n })(index !== -1) : {};\n relationship.localState.splice(index, 1);\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected relationship to be dirty when performing a local mutation`);\n }\n })(relationship.localState || relationship.isDirty) : {};\n return true;\n}\nfunction _removeRemote(relationship, value) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected an identifier to remove from the collection relationship`);\n }\n })(value) : {};\n const {\n remoteMembers,\n additions,\n removals,\n remoteState\n } = relationship;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot remove a resource that is not present`);\n }\n })(remoteMembers.has(value)) : {};\n if (!remoteMembers.has(value)) {\n return false;\n }\n\n // remove from remote state\n remoteMembers.delete(value);\n let index = remoteState.indexOf(value);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot remove a resource that is not present`);\n }\n })(index !== -1) : {};\n remoteState.splice(index, 1);\n\n // remove from removals if present\n if (removals?.has(value)) {\n removals.delete(value);\n\n // nothing more to do this was our state already\n return false;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Remote state indicated removal of a resource that was present only as a local mutation`);\n }\n })(!additions?.has(value)) : {};\n\n // if we have existing localState\n // and we have an index\n // apply the change, as this is more efficient\n // than recomputing localState and\n // it allows us to preserve local ordering\n // to a small extend. Local ordering should not\n // be relied upon as any remote change will blow it away\n if (relationship.localState) {\n index = relationship.localState.indexOf(value);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot remove a resource that is not present`);\n }\n })(index !== -1) : {};\n relationship.localState.splice(index, 1);\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected relationship to be dirty when performing a local mutation`);\n }\n })(relationship.localState || relationship.isDirty) : {};\n return true;\n}\nfunction rollbackRelationship(graph, identifier, field, relationship) {\n if (isBelongsTo(relationship)) {\n replaceRelatedRecord(graph, {\n op: 'replaceRelatedRecord',\n record: identifier,\n field,\n value: relationship.remoteState\n }, false);\n } else {\n replaceRelatedRecords(graph, {\n op: 'replaceRelatedRecords',\n record: identifier,\n field,\n value: relationship.remoteState.slice()\n }, false);\n }\n}\nfunction createState() {\n return {\n hasReceivedData: false,\n isEmpty: true,\n isStale: false,\n hasFailedLoadAttempt: false,\n shouldForceReload: false,\n hasDematerializedInverse: false\n };\n}\nfunction createCollectionEdge(definition, identifier) {\n return {\n definition,\n identifier,\n state: createState(),\n remoteMembers: new Set(),\n remoteState: [],\n additions: null,\n removals: null,\n meta: null,\n links: null,\n localState: null,\n isDirty: true,\n transactionRef: 0,\n _diff: undefined\n };\n}\nfunction legacyGetCollectionRelationshipData(source) {\n const payload = {};\n if (source.state.hasReceivedData) {\n payload.data = computeLocalState(source);\n }\n if (source.links) {\n payload.links = source.links;\n }\n if (source.meta) {\n payload.meta = source.meta;\n }\n return payload;\n}\nfunction createImplicitEdge(definition, identifier) {\n return {\n definition,\n identifier,\n localMembers: new Set(),\n remoteMembers: new Set()\n };\n}\n\n/*\n * @module @ember-data/graph\n *\n * Stores the data for one side of a \"single\" resource relationship.\n *\n * @class ResourceEdge\n * @internal\n */\n\nfunction createResourceEdge(definition, identifier) {\n return {\n definition,\n identifier,\n state: createState(),\n transactionRef: 0,\n localState: null,\n remoteState: null,\n meta: null,\n links: null\n };\n}\nfunction legacyGetResourceRelationshipData(source) {\n let data;\n const payload = {};\n if (source.localState) {\n data = source.localState;\n }\n if (source.localState === null && source.state.hasReceivedData) {\n data = null;\n }\n if (source.links) {\n payload.links = source.links;\n }\n if (data !== undefined) {\n payload.data = data;\n }\n if (source.meta) {\n payload.meta = source.meta;\n }\n return payload;\n}\nfunction addToRelatedRecords(graph, op, isRemote) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Graph does not yet support updating the remote state of a relationship via the ${op.op} operation`);\n }\n })(!isRemote) : {};\n const {\n record,\n value,\n index\n } = op;\n const relationship = graph.get(record, op.field);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You can only '${op.op}' on a hasMany relationship. ${record.type}.${op.field} is a ${relationship.definition.kind}`);\n }\n })(isHasMany(relationship)) : {};\n if (Array.isArray(value)) {\n for (let i = 0; i < value.length; i++) {\n addRelatedRecord(graph, relationship, record, value[i], index !== undefined ? index + i : index, isRemote);\n }\n } else {\n addRelatedRecord(graph, relationship, record, value, index, isRemote);\n }\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n}\nfunction addRelatedRecord(graph, relationship, record, value, index, isRemote) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected an identifier to add to the collection relationship`);\n }\n })(value) : {};\n if (_addLocal(graph, record, relationship, value, index ?? null)) {\n addToInverse(graph, value, relationship.definition.inverseKey, record, isRemote);\n }\n}\nfunction mergeIdentifier(graph, op, relationships) {\n Object.keys(relationships).forEach(key => {\n const rel = relationships[key];\n if (!rel) {\n return;\n }\n mergeIdentifierForRelationship(graph, op, rel);\n });\n}\nfunction mergeIdentifierForRelationship(graph, op, rel) {\n rel.identifier = op.value;\n forAllRelatedIdentifiers(rel, identifier => {\n const inverse = graph.get(identifier, rel.definition.inverseKey);\n mergeInRelationship(graph, inverse, op);\n });\n}\nfunction mergeInRelationship(graph, rel, op) {\n if (isBelongsTo(rel)) {\n mergeBelongsTo(graph, rel, op);\n } else if (isHasMany(rel)) {\n mergeHasMany(graph, rel, op);\n } else {\n mergeImplicit(graph, rel, op);\n }\n}\nfunction mergeBelongsTo(graph, rel, op) {\n if (rel.remoteState === op.record) {\n rel.remoteState = op.value;\n }\n if (rel.localState === op.record) {\n rel.localState = op.value;\n notifyChange(graph, rel.identifier, rel.definition.key);\n }\n}\nfunction mergeHasMany(graph, rel, op) {\n if (rel.remoteMembers.has(op.record)) {\n rel.remoteMembers.delete(op.record);\n rel.remoteMembers.add(op.value);\n const index = rel.remoteState.indexOf(op.record);\n rel.remoteState.splice(index, 1, op.value);\n rel.isDirty = true;\n }\n if (rel.additions?.has(op.record)) {\n rel.additions.delete(op.record);\n rel.additions.add(op.value);\n rel.isDirty = true;\n }\n if (rel.removals?.has(op.record)) {\n rel.removals.delete(op.record);\n rel.removals.add(op.value);\n rel.isDirty = true;\n }\n if (rel.isDirty) {\n notifyChange(graph, rel.identifier, rel.definition.key);\n }\n}\nfunction mergeImplicit(graph, rel, op) {\n if (rel.remoteMembers.has(op.record)) {\n rel.remoteMembers.delete(op.record);\n rel.remoteMembers.add(op.value);\n }\n if (rel.localMembers.has(op.record)) {\n rel.localMembers.delete(op.record);\n rel.localMembers.add(op.value);\n }\n}\nfunction removeFromRelatedRecords(graph, op, isRemote) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Graph does not yet support updating the remote state of a relationship via the ${op.op} operation`);\n }\n })(!isRemote) : {};\n const {\n record,\n value\n } = op;\n const relationship = graph.get(record, op.field);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You can only '${op.op}' on a hasMany relationship. ${record.type}.${op.field} is a ${relationship.definition.kind}`);\n }\n })(isHasMany(relationship)) : {};\n // TODO we should potentially thread the index information through here\n // when available as it may make it faster to remove from the local state\n // when trying to patch more efficiently without blowing away the entire\n // local state array\n if (Array.isArray(value)) {\n for (let i = 0; i < value.length; i++) {\n removeRelatedRecord(graph, relationship, record, value[i], isRemote);\n }\n } else {\n removeRelatedRecord(graph, relationship, record, value, isRemote);\n }\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n}\nfunction removeRelatedRecord(graph, relationship, record, value, isRemote) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected an identifier to remove from the collection relationship`);\n }\n })(value) : {};\n if (_removeLocal(relationship, value)) {\n removeFromInverse(graph, value, relationship.definition.inverseKey, record, isRemote);\n }\n}\n\n/*\n This method normalizes a link to an \"links object\". If the passed link is\n already an object it's returned without any modifications.\n\n See http://jsonapi.org/format/#document-links for more information.\n*/\nfunction _normalizeLink(link) {\n switch (typeof link) {\n case 'object':\n return link;\n case 'string':\n return {\n href: link\n };\n }\n}\n\n/*\n Updates the \"canonical\" or \"remote\" state of a relationship, replacing any existing\n state and blowing away any local changes (excepting new records).\n*/\nfunction updateRelationshipOperation(graph, op) {\n const relationship = graph.get(op.record, op.field);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot update an implicit relationship`);\n }\n })(isHasMany(relationship) || isBelongsTo(relationship)) : {};\n const {\n definition,\n state,\n identifier\n } = relationship;\n const {\n isCollection\n } = definition;\n const payload = op.value;\n let hasRelationshipDataProperty = false;\n let hasUpdatedLink = false;\n if (payload.meta) {\n relationship.meta = payload.meta;\n }\n if (payload.data !== undefined) {\n hasRelationshipDataProperty = true;\n if (isCollection) {\n // TODO deprecate this case. We\n // have tests saying we support it.\n if (payload.data === null) {\n payload.data = [];\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected an array`);\n }\n })(Array.isArray(payload.data)) : {};\n const cache = graph.store.identifierCache;\n graph.update({\n op: 'replaceRelatedRecords',\n record: identifier,\n field: op.field,\n value: upgradeIdentifiers(payload.data, cache)\n }, true);\n } else {\n graph.update({\n op: 'replaceRelatedRecord',\n record: identifier,\n field: op.field,\n value: payload.data ? graph.store.identifierCache.upgradeIdentifier(payload.data) : null\n }, true);\n }\n } else if (definition.isAsync === false && !state.hasReceivedData) {\n hasRelationshipDataProperty = true;\n if (isCollection) {\n graph.update({\n op: 'replaceRelatedRecords',\n record: identifier,\n field: op.field,\n value: []\n }, true);\n } else {\n graph.update({\n op: 'replaceRelatedRecord',\n record: identifier,\n field: op.field,\n value: null\n }, true);\n }\n }\n if (payload.links) {\n const originalLinks = relationship.links;\n relationship.links = payload.links;\n if (payload.links.related) {\n const relatedLink = _normalizeLink(payload.links.related);\n const currentLink = originalLinks && originalLinks.related ? _normalizeLink(originalLinks.related) : null;\n const currentLinkHref = currentLink ? currentLink.href : null;\n if (relatedLink && relatedLink.href && relatedLink.href !== currentLinkHref) {\n warn(`You pushed a record of type '${identifier.type}' with a relationship '${definition.key}' configured as 'async: false'. You've included a link but no primary data, this may be an error in your payload. EmberData will treat this relationship as known-to-be-empty.`, definition.isAsync || state.hasReceivedData, {\n id: 'ds.store.push-link-for-sync-relationship'\n });\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You have pushed a record of type '${identifier.type}' with '${definition.key}' as a link, but the value of that link is not a string.`);\n }\n })(typeof relatedLink.href === 'string' || relatedLink.href === null) : {};\n hasUpdatedLink = true;\n }\n }\n }\n\n /*\n Data being pushed into the relationship might contain only data or links,\n or a combination of both.\n IF contains only data\n IF contains both links and data\n state.isEmpty -> true if is empty array (has-many) or is null (belongs-to)\n state.hasReceivedData -> true\n hasDematerializedInverse -> false\n state.isStale -> false\n allInverseRecordsAreLoaded -> run-check-to-determine\n IF contains only links\n state.isStale -> true\n */\n relationship.state.hasFailedLoadAttempt = false;\n if (hasRelationshipDataProperty) {\n const relationshipIsEmpty = payload.data === null || Array.isArray(payload.data) && payload.data.length === 0;\n\n // we don't need to notify here as the update op we pushed in above will notify once\n // membership is in the correct state.\n relationship.state.hasReceivedData = true;\n relationship.state.isStale = false;\n relationship.state.hasDematerializedInverse = false;\n relationship.state.isEmpty = relationshipIsEmpty;\n } else if (hasUpdatedLink) {\n // only notify stale if we have not previously received membership data.\n // within this same transaction\n // this prevents refetching when only one side of the relationship in the\n // payload contains the info while the other side contains just a link\n // this only works when the side with just a link is a belongsTo, as we\n // don't know if a hasMany has full information or not.\n // see #7049 for context.\n if (isCollection || !relationship.state.hasReceivedData || isStaleTransaction(relationship.transactionRef, graph._transaction)) {\n relationship.state.isStale = true;\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n } else {\n relationship.state.isStale = false;\n }\n }\n}\nfunction isStaleTransaction(relationshipTransactionId, graphTransactionId) {\n return relationshipTransactionId === 0 ||\n // relationship has never notified\n graphTransactionId === null ||\n // we are not in a transaction\n relationshipTransactionId < graphTransactionId // we are not part of the current transaction\n ;\n}\nfunction upgradeIdentifiers(arr, cache) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = cache.upgradeIdentifier(arr[i]);\n }\n return arr;\n}\nconst Graphs = getOrSetGlobal('Graphs', new Map());\n/*\n * Graph acts as the cache for relationship data. It allows for\n * us to ask about and update relationships for a given Identifier\n * without requiring other objects for that Identifier to be\n * instantiated (such as `RecordData` or a `Record`)\n *\n * This also allows for us to make more substantive changes to relationships\n * with increasingly minor alterations to other portions of the internals\n * over time.\n *\n * The graph is made up of nodes and edges. Each unique identifier gets\n * its own node, which is a dictionary with a list of that node's edges\n * (or connections) to other nodes. In `Model` terms, a node represents a\n * record instance, with each key (an edge) in the dictionary correlating\n * to either a `hasMany` or `belongsTo` field on that record instance.\n *\n * The value for each key, or `edge` is the identifier(s) the node relates\n * to in the graph from that key.\n */\nclass Graph {\n constructor(store) {\n this._definitionCache = Object.create(null);\n this._metaCache = Object.create(null);\n this._potentialPolymorphicTypes = Object.create(null);\n this.identifiers = new Map();\n this.store = store;\n this.isDestroyed = false;\n this._willSyncRemote = false;\n this._willSyncLocal = false;\n this._pushedUpdates = {\n belongsTo: undefined,\n hasMany: undefined,\n deletions: []\n };\n this._updatedRelationships = new Set();\n this._transaction = null;\n this._removing = null;\n this.silenceNotifications = false;\n }\n has(identifier, propertyName) {\n const relationships = this.identifiers.get(identifier);\n if (!relationships) {\n return false;\n }\n return relationships[propertyName] !== undefined;\n }\n getDefinition(identifier, propertyName) {\n let defs = this._metaCache[identifier.type];\n let meta = defs?.[propertyName];\n if (!meta) {\n const info = /*#__NOINLINE__*/upgradeDefinition(this, identifier, propertyName);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Could not determine relationship information for ${identifier.type}.${propertyName}`);\n }\n })(info !== null) : {};\n\n // if (info.rhs_definition?.kind === 'implicit') {\n // we should possibly also do this\n // but it would result in being extremely permissive for other relationships by accident\n // this.registerPolymorphicType(info.rhs_baseModelName, identifier.type);\n // }\n\n meta = /*#__NOINLINE__*/isLHS(info, identifier.type, propertyName) ? info.lhs_definition : info.rhs_definition;\n defs = this._metaCache[identifier.type] = defs || {};\n defs[propertyName] = meta;\n }\n return meta;\n }\n get(identifier, propertyName) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected propertyName`);\n }\n })(propertyName) : {};\n let relationships = this.identifiers.get(identifier);\n if (!relationships) {\n relationships = Object.create(null);\n this.identifiers.set(identifier, relationships);\n }\n let relationship = relationships[propertyName];\n if (!relationship) {\n const meta = this.getDefinition(identifier, propertyName);\n if (meta.kind === 'belongsTo') {\n relationship = relationships[propertyName] = createResourceEdge(meta, identifier);\n } else if (meta.kind === 'hasMany') {\n relationship = relationships[propertyName] = createCollectionEdge(meta, identifier);\n } else {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected kind to be implicit`);\n }\n })(meta.kind === 'implicit' && meta.isImplicit === true) : {};\n relationship = relationships[propertyName] = createImplicitEdge(meta, identifier);\n }\n }\n return relationship;\n }\n getData(identifier, propertyName) {\n const relationship = this.get(identifier, propertyName);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot getData() on an implicit relationship`);\n }\n })(!isImplicit(relationship)) : {};\n if (isBelongsTo(relationship)) {\n return legacyGetResourceRelationshipData(relationship);\n }\n return legacyGetCollectionRelationshipData(relationship);\n }\n\n /*\n * Allows for the graph to dynamically discover polymorphic connections\n * without needing to walk prototype chains.\n *\n * Used by edges when an added `type` does not match the expected `type`\n * for that edge.\n *\n * Currently we assert before calling this. For a public API we will want\n * to call out to the schema manager to ask if we should consider these\n * types as equivalent for a given relationship.\n */\n registerPolymorphicType(type1, type2) {\n const typeCache = this._potentialPolymorphicTypes;\n let t1 = typeCache[type1];\n if (!t1) {\n t1 = typeCache[type1] = Object.create(null);\n }\n t1[type2] = true;\n let t2 = typeCache[type2];\n if (!t2) {\n t2 = typeCache[type2] = Object.create(null);\n }\n t2[type1] = true;\n }\n\n /*\n TODO move this comment somewhere else\n implicit relationships are relationships which have not been declared but the inverse side exists on\n another record somewhere\n For example if there was:\n ```app/models/comment.js\n import Model, { attr } from '@ember-data/model';\n export default class Comment extends Model {\n @attr text;\n }\n ```\n and there is also:\n ```app/models/post.js\n import Model, { attr, hasMany } from '@ember-data/model';\n export default class Post extends Model {\n @attr title;\n @hasMany('comment', { async: true, inverse: null }) comments;\n }\n ```\n Then we would have a implicit 'post' relationship for the comment record in order\n to be do things like remove the comment from the post if the comment were to be deleted.\n */\n\n isReleasable(identifier) {\n const relationships = this.identifiers.get(identifier);\n if (!relationships) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`graph: RELEASABLE ${String(identifier)}`);\n }\n return true;\n }\n const keys = Object.keys(relationships);\n for (let i = 0; i < keys.length; i++) {\n const relationship = relationships[keys[i]];\n // account for previously unloaded relationships\n // typically from a prior deletion of a record that pointed to this one implicitly\n if (relationship === undefined) {\n continue;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a relationship`);\n }\n })(relationship) : {};\n if (relationship.definition.inverseIsAsync && !isNew(identifier)) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`graph: <> RELEASABLE ${String(identifier)}`);\n }\n return false;\n }\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`graph: RELEASABLE ${String(identifier)}`);\n }\n return true;\n }\n unload(identifier, silenceNotifications) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`graph: unload ${String(identifier)}`);\n }\n const relationships = this.identifiers.get(identifier);\n if (relationships) {\n // cleans up the graph but retains some nodes\n // to allow for rematerialization\n Object.keys(relationships).forEach(key => {\n const rel = relationships[key];\n if (!rel) {\n return;\n }\n /*#__NOINLINE__*/\n destroyRelationship(this, rel, silenceNotifications);\n if ( /*#__NOINLINE__*/isImplicit(rel)) {\n // @ts-expect-error\n relationships[key] = undefined;\n }\n });\n }\n }\n _isDirty(identifier, field) {\n const relationships = this.identifiers.get(identifier);\n if (!relationships) {\n return false;\n }\n const relationship = relationships[field];\n if (!relationship) {\n return false;\n }\n if (isBelongsTo(relationship)) {\n return relationship.localState !== relationship.remoteState;\n } else if (isHasMany(relationship)) {\n const hasAdditions = relationship.additions !== null && relationship.additions.size > 0;\n const hasRemovals = relationship.removals !== null && relationship.removals.size > 0;\n return hasAdditions || hasRemovals || isReordered(relationship);\n }\n return false;\n }\n getChanged(identifier) {\n const relationships = this.identifiers.get(identifier);\n const changed = new Map();\n if (!relationships) {\n return changed;\n }\n const keys = Object.keys(relationships);\n for (let i = 0; i < keys.length; i++) {\n const field = keys[i];\n const relationship = relationships[field];\n if (!relationship) {\n continue;\n }\n if (isBelongsTo(relationship)) {\n if (relationship.localState !== relationship.remoteState) {\n changed.set(field, {\n kind: 'resource',\n remoteState: relationship.remoteState,\n localState: relationship.localState\n });\n }\n } else if (isHasMany(relationship)) {\n const hasAdditions = relationship.additions !== null && relationship.additions.size > 0;\n const hasRemovals = relationship.removals !== null && relationship.removals.size > 0;\n const reordered = isReordered(relationship);\n if (hasAdditions || hasRemovals || reordered) {\n changed.set(field, {\n kind: 'collection',\n additions: new Set(relationship.additions) || new Set(),\n removals: new Set(relationship.removals) || new Set(),\n remoteState: relationship.remoteState,\n localState: legacyGetCollectionRelationshipData(relationship).data || [],\n reordered\n });\n }\n }\n }\n return changed;\n }\n hasChanged(identifier) {\n const relationships = this.identifiers.get(identifier);\n if (!relationships) {\n return false;\n }\n const keys = Object.keys(relationships);\n for (let i = 0; i < keys.length; i++) {\n if (this._isDirty(identifier, keys[i])) {\n return true;\n }\n }\n return false;\n }\n rollback(identifier) {\n const relationships = this.identifiers.get(identifier);\n const changed = [];\n if (!relationships) {\n return changed;\n }\n const keys = Object.keys(relationships);\n for (let i = 0; i < keys.length; i++) {\n const field = keys[i];\n const relationship = relationships[field];\n if (!relationship) {\n continue;\n }\n if (this._isDirty(identifier, field)) {\n rollbackRelationship(this, identifier, field, relationship);\n changed.push(field);\n }\n }\n return changed;\n }\n remove(identifier) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`graph: remove ${String(identifier)}`);\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot remove ${String(identifier)} while still removing ${String(this._removing)}`);\n }\n })(!this._removing) : {};\n this._removing = identifier;\n this.unload(identifier);\n this.identifiers.delete(identifier);\n this._removing = null;\n }\n\n /*\n * Remote state changes\n */\n push(op) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`graph: push ${String(op.record)}`, op);\n }\n if (op.op === 'deleteRecord') {\n this._pushedUpdates.deletions.push(op);\n } else {\n const definition = this.getDefinition(op.record, op.field);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot push a remote update for an implicit relationship`);\n }\n })(definition.kind !== 'implicit') : {};\n addPending(this._pushedUpdates, definition, op);\n }\n if (!this._willSyncRemote) {\n this._willSyncRemote = true;\n getStore(this.store)._schedule('coalesce', () => this._flushRemoteQueue());\n }\n }\n\n /*\n * Local state changes\n */\n\n update(op, isRemote = false) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot update an implicit relationship`);\n }\n })(op.op === 'deleteRecord' || op.op === 'mergeIdentifiers' || !isImplicit(this.get(op.record, op.field))) : {};\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`graph: update (${isRemote ? 'remote' : 'local'}) ${String(op.record)}`, op);\n }\n switch (op.op) {\n case 'mergeIdentifiers':\n {\n const relationships = this.identifiers.get(op.record);\n if (relationships) {\n /*#__NOINLINE__*/mergeIdentifier(this, op, relationships);\n }\n break;\n }\n case 'updateRelationship':\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Can only perform the operation updateRelationship on remote state`);\n }\n })(isRemote) : {};\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n // in debug, assert payload validity eagerly\n // TODO add deprecations/assertion here for duplicates\n assertValidRelationshipPayload(this, op);\n }\n /*#__NOINLINE__*/\n updateRelationshipOperation(this, op);\n break;\n case 'deleteRecord':\n {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Can only perform the operation deleteRelationship on remote state`);\n }\n })(isRemote) : {};\n const identifier = op.record;\n const relationships = this.identifiers.get(identifier);\n if (relationships) {\n Object.keys(relationships).forEach(key => {\n const rel = relationships[key];\n if (!rel) {\n return;\n }\n // works together with the has check\n // @ts-expect-error\n relationships[key] = undefined;\n /*#__NOINLINE__*/\n removeCompletelyFromInverse(this, rel);\n });\n this.identifiers.delete(identifier);\n }\n break;\n }\n case 'replaceRelatedRecord':\n /*#__NOINLINE__*/replaceRelatedRecord(this, op, isRemote);\n break;\n case 'addToRelatedRecords':\n // we will lift this restriction once the cache is allowed to make remote updates directly\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Can only perform the operation addToRelatedRecords on local state`);\n }\n })(!isRemote) : {};\n /*#__NOINLINE__*/\n addToRelatedRecords(this, op, isRemote);\n break;\n case 'removeFromRelatedRecords':\n // we will lift this restriction once the cache is allowed to make remote updates directly\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Can only perform the operation removeFromRelatedRecords on local state`);\n }\n })(!isRemote) : {};\n /*#__NOINLINE__*/\n removeFromRelatedRecords(this, op, isRemote);\n break;\n case 'replaceRelatedRecords':\n /*#__NOINLINE__*/replaceRelatedRecords(this, op, isRemote);\n break;\n default:\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`No local relationship update operation exists for '${op.op}'`);\n }\n })() : {};\n }\n }\n _scheduleLocalSync(relationship) {\n this._updatedRelationships.add(relationship);\n if (!this._willSyncLocal) {\n this._willSyncLocal = true;\n getStore(this.store)._schedule('sync', () => this._flushLocalQueue());\n }\n }\n _flushRemoteQueue() {\n if (!this._willSyncRemote) {\n return;\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.groupCollapsed(`Graph: Initialized Transaction`);\n }\n let transactionRef = peekTransient('transactionRef') ?? 0;\n this._transaction = ++transactionRef;\n setTransient('transactionRef', transactionRef);\n this._willSyncRemote = false;\n const updates = this._pushedUpdates;\n const {\n deletions,\n hasMany,\n belongsTo\n } = updates;\n updates.deletions = [];\n updates.hasMany = undefined;\n updates.belongsTo = undefined;\n for (let i = 0; i < deletions.length; i++) {\n this.update(deletions[i], true);\n }\n if (hasMany) {\n flushPending(this, hasMany);\n }\n if (belongsTo) {\n flushPending(this, belongsTo);\n }\n this._transaction = null;\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`Graph: transaction finalized`);\n // eslint-disable-next-line no-console\n console.groupEnd();\n }\n }\n _addToTransaction(relationship) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected a transaction`);\n }\n })(this._transaction !== null) : {};\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_GRAPH)) {\n // eslint-disable-next-line no-console\n console.log(`Graph: ${String(relationship.identifier)} ${relationship.definition.key} added to transaction`);\n }\n relationship.transactionRef = this._transaction;\n }\n _flushLocalQueue() {\n if (!this._willSyncLocal) {\n return;\n }\n if (this.silenceNotifications) {\n this.silenceNotifications = false;\n this._updatedRelationships = new Set();\n return;\n }\n this._willSyncLocal = false;\n const updated = this._updatedRelationships;\n this._updatedRelationships = new Set();\n updated.forEach(rel => notifyChange(this, rel.identifier, rel.definition.key));\n }\n destroy() {\n Graphs.delete(this.store);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n Graphs.delete(getStore(this.store));\n if (Graphs.size) {\n Graphs.forEach((_, key) => {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Memory Leak Detected, likely the test or app instance previous to this was not torn down properly`);\n }\n })(!key.isDestroyed && !key.isDestroying) : {};\n });\n }\n }\n this.identifiers.clear();\n this.store = null;\n this.isDestroyed = true;\n }\n}\nfunction flushPending(graph, ops) {\n ops.forEach(type => {\n type.forEach(opList => {\n flushPendingList(graph, opList);\n });\n });\n}\nfunction flushPendingList(graph, opList) {\n for (let i = 0; i < opList.length; i++) {\n graph.update(opList[i], true);\n }\n}\n\n// Handle dematerialization for relationship `rel`. In all cases, notify the\n// relationship of the dematerialization: this is done so the relationship can\n// notify its inverse which needs to update state\n//\n// If the inverse is sync, unloading this record is treated as a client-side\n// delete, so we remove the inverse records from this relationship to\n// disconnect the graph. Because it's not async, we don't need to keep around\n// the identifier as an id-wrapper for references\nfunction destroyRelationship(graph, rel, silenceNotifications) {\n if (isImplicit(rel)) {\n if (graph.isReleasable(rel.identifier)) {\n /*#__NOINLINE__*/removeCompletelyFromInverse(graph, rel);\n }\n return;\n }\n const {\n identifier\n } = rel;\n const {\n inverseKey\n } = rel.definition;\n if (!rel.definition.inverseIsImplicit) {\n /*#__NOINLINE__*/forAllRelatedIdentifiers(rel, inverseIdentifer => /*#__NOINLINE__*/notifyInverseOfDematerialization(graph, inverseIdentifer, inverseKey, identifier, silenceNotifications));\n }\n if (!rel.definition.inverseIsImplicit && !rel.definition.inverseIsAsync) {\n rel.state.isStale = true;\n /*#__NOINLINE__*/\n clearRelationship(rel);\n\n // necessary to clear relationships in the ui from dematerialized records\n // hasMany is managed by Model which calls `retreiveLatest` after\n // dematerializing the resource-cache instance.\n // but sync belongsTo requires this since they don't have a proxy to update.\n // so we have to notify so it will \"update\" to null.\n // we should discuss whether we still care about this, probably fine to just\n // leave the ui relationship populated since the record is destroyed and\n // internally we've fully cleaned up.\n if (!rel.definition.isAsync && !silenceNotifications) {\n /*#__NOINLINE__*/notifyChange(graph, rel.identifier, rel.definition.key);\n }\n }\n}\nfunction notifyInverseOfDematerialization(graph, inverseIdentifier, inverseKey, identifier, silenceNotifications) {\n if (!graph.has(inverseIdentifier, inverseKey)) {\n return;\n }\n const relationship = graph.get(inverseIdentifier, inverseKey);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected no implicit`);\n }\n })(!isImplicit(relationship)) : {};\n\n // For remote members, it is possible that inverseRecordData has already been associated to\n // to another record. For such cases, do not dematerialize the inverseRecordData\n if (!isBelongsTo(relationship) || !relationship.localState || identifier === relationship.localState) {\n /*#__NOINLINE__*/removeDematerializedInverse(graph, relationship, identifier, silenceNotifications);\n }\n}\nfunction clearRelationship(relationship) {\n if (isBelongsTo(relationship)) {\n relationship.localState = null;\n relationship.remoteState = null;\n relationship.state.hasReceivedData = false;\n relationship.state.isEmpty = true;\n } else {\n relationship.remoteMembers.clear();\n relationship.remoteState = [];\n relationship.additions = null;\n relationship.removals = null;\n relationship.localState = null;\n }\n}\nfunction removeDematerializedInverse(graph, relationship, inverseIdentifier, silenceNotifications) {\n if (isBelongsTo(relationship)) {\n const localInverse = relationship.localState;\n if (!relationship.definition.isAsync || localInverse && isNew(localInverse)) {\n // unloading inverse of a sync relationship is treated as a client-side\n // delete, so actually remove the models don't merely invalidate the cp\n // cache.\n // if the record being unloaded only exists on the client, we similarly\n // treat it as a client side delete\n if (relationship.localState === localInverse && localInverse !== null) {\n relationship.localState = null;\n }\n if (relationship.remoteState === localInverse && localInverse !== null) {\n relationship.remoteState = null;\n relationship.state.hasReceivedData = true;\n relationship.state.isEmpty = true;\n if (relationship.localState && !isNew(relationship.localState)) {\n relationship.localState = null;\n }\n }\n } else {\n relationship.state.hasDematerializedInverse = true;\n }\n if (!silenceNotifications) {\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n }\n } else {\n if (!relationship.definition.isAsync || inverseIdentifier && isNew(inverseIdentifier)) {\n // unloading inverse of a sync relationship is treated as a client-side\n // delete, so actually remove the models don't merely invalidate the cp\n // cache.\n // if the record being unloaded only exists on the client, we similarly\n // treat it as a client side delete\n /*#__NOINLINE__*/\n removeIdentifierCompletelyFromRelationship(graph, relationship, inverseIdentifier);\n } else {\n relationship.state.hasDematerializedInverse = true;\n }\n if (!silenceNotifications) {\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n }\n }\n}\nfunction removeCompletelyFromInverse(graph, relationship) {\n const {\n identifier\n } = relationship;\n const {\n inverseKey\n } = relationship.definition;\n forAllRelatedIdentifiers(relationship, inverseIdentifier => {\n if (graph.has(inverseIdentifier, inverseKey)) {\n removeIdentifierCompletelyFromRelationship(graph, graph.get(inverseIdentifier, inverseKey), identifier);\n }\n });\n if (isBelongsTo(relationship)) {\n if (!relationship.definition.isAsync) {\n clearRelationship(relationship);\n }\n relationship.localState = null;\n } else if (isHasMany(relationship)) {\n if (!relationship.definition.isAsync) {\n clearRelationship(relationship);\n notifyChange(graph, relationship.identifier, relationship.definition.key);\n }\n } else {\n relationship.remoteMembers.clear();\n relationship.localMembers.clear();\n }\n}\nfunction addPending(cache, definition, op) {\n const lc = cache[definition.kind] = cache[definition.kind] || new Map();\n let lc2 = lc.get(definition.inverseType);\n if (!lc2) {\n lc2 = new Map();\n lc.set(definition.inverseType, lc2);\n }\n let arr = lc2.get(op.field);\n if (!arr) {\n arr = [];\n lc2.set(op.field, arr);\n }\n arr.push(op);\n}\nfunction isReordered(relationship) {\n // if we are dirty we are never re-ordered because accessing\n // the state would flush away any reordering.\n if (relationship.isDirty) {\n return false;\n }\n const {\n remoteState,\n localState,\n additions,\n removals\n } = relationship;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected localSate`);\n }\n })(localState) : {};\n for (let i = 0, j = 0; i < remoteState.length; i++) {\n const member = remoteState[i];\n const localMember = localState[j];\n if (member !== localMember) {\n if (removals && removals.has(member)) {\n // dont increment j because we want to skip this\n continue;\n }\n if (additions && additions.has(localMember)) {\n // increment j to skip this localMember\n // decrement i to repeat this remoteMember\n j++;\n i--;\n continue;\n }\n return true;\n }\n\n // if we made it here, increment j\n j++;\n }\n return false;\n}\n\n/**\n *
\n \n
\n\n
Provides a performance tuned normalized graph for intelligently managing relationships between resources based on identity
\n\nWhile this Graph is abstract, it currently is a private implementation required as a peer-dependency by the [JSON:API Cache Implementation](https://github.com/emberjs/data/tree/main/packages/json-api).\n\nWe intend to make this Graph public API after some additional iteration during the 5.x timeframe, until then all APIs should be considered experimental and unstable, not fit for direct application or 3rd party library usage.\n\n## Installation\n\nInstall using your javascript package manager of choice. For instance with [pnpm](https://pnpm.io/)\n\n```no-highlight\npnpm add @ember-data/graph\n```\n\n @module @ember-data/graph\n @main @ember-data/graph\n*/\n\nfunction isStore(maybeStore) {\n return maybeStore._instanceCache !== undefined;\n}\nfunction getWrapper(store) {\n return isStore(store) ? store._instanceCache._storeWrapper : store;\n}\nfunction peekGraph(store) {\n return Graphs.get(getWrapper(store));\n}\nfunction graphFor(store) {\n const wrapper = getWrapper(store);\n let graph = Graphs.get(wrapper);\n if (!graph) {\n graph = new Graph(wrapper);\n Graphs.set(wrapper, graph);\n getStore(wrapper)._graph = graph;\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (getStore(wrapper).isDestroying) {\n throw new Error(`Memory Leak Detected During Teardown`);\n }\n }\n }\n return graph;\n}\nexport { graphFor, isBelongsTo, peekGraph };","import { SOURCE, coerceId } from '@ember-data/store/-private';\nimport { warn } from '@ember/debug';\nimport { macroCondition, getGlobalConfig, dependencySatisfies, importSync } from '@embroider/macros';\nimport { createDeferred } from '@ember-data/request';\nimport { getOrSetGlobal } from '@warp-drive/core-types/-private';\n\n/**\n @module @ember-data/legacy-compat\n*/\n\n/**\n SnapshotRecordArray is not directly instantiable.\n Instances are provided to consuming application's\n adapters for certain `findAll` requests.\n\n @class SnapshotRecordArray\n @public\n*/\nclass SnapshotRecordArray {\n /**\n SnapshotRecordArray is not directly instantiable.\n Instances are provided to consuming application's\n adapters and serializers for certain requests.\n @method constructor\n @private\n @constructor\n @param {Store} store\n @param {string} type\n @param options\n */\n constructor(store, type, options = {}) {\n this.__store = store;\n /**\n An array of snapshots\n @private\n @property _snapshots\n @type {Array}\n */\n this._snapshots = null;\n\n /**\n The modelName of the underlying records for the snapshots in the array, as a Model\n @property modelName\n @public\n @type {Model}\n */\n this.modelName = type;\n\n /**\n A hash of adapter options passed into the store method for this request.\n Example\n ```app/adapters/post.js\n import MyCustomAdapter from './custom-adapter';\n export default class PostAdapter extends MyCustomAdapter {\n findAll(store, type, sinceToken, snapshotRecordArray) {\n if (snapshotRecordArray.adapterOptions.subscribe) {\n // ...\n }\n // ...\n }\n }\n ```\n @property adapterOptions\n @public\n @type {Object}\n */\n this.adapterOptions = options.adapterOptions;\n\n /**\n The relationships to include for this request.\n Example\n ```app/adapters/application.js\n import Adapter from '@ember-data/adapter';\n export default class ApplicationAdapter extends Adapter {\n findAll(store, type, snapshotRecordArray) {\n let url = `/${type.modelName}?include=${encodeURIComponent(snapshotRecordArray.include)}`;\n return fetch(url).then((response) => response.json())\n }\n }\n ```\n @property include\n @public\n @type {String|Array}\n */\n this.include = options.include;\n }\n\n /**\n An array of records\n @property _recordArray\n @private\n @type {Array}\n */\n get _recordArray() {\n return this.__store.peekAll(this.modelName);\n }\n\n /**\n Number of records in the array\n Example\n ```app/adapters/post.js\n import JSONAPIAdapter from '@ember-data/adapter/json-api';\n export default class PostAdapter extends JSONAPIAdapter {\n shouldReloadAll(store, snapshotRecordArray) {\n return !snapshotRecordArray.length;\n }\n });\n ```\n @property length\n @public\n @type {Number}\n */\n get length() {\n return this._recordArray.length;\n }\n\n /**\n Get snapshots of the underlying record array\n Example\n ```app/adapters/post.js\n import JSONAPIAdapter from '@ember-data/adapter/json-api';\n export default class PostAdapter extends JSONAPIAdapter {\n shouldReloadAll(store, snapshotArray) {\n let snapshots = snapshotArray.snapshots();\n return snapshots.any(function(ticketSnapshot) {\n let timeDiff = moment().diff(ticketSnapshot.attr('lastAccessedAt'), 'minutes');\n if (timeDiff > 20) {\n return true;\n } else {\n return false;\n }\n });\n }\n }\n ```\n @method snapshots\n @public\n @return {Array} Array of snapshots\n */\n snapshots() {\n if (this._snapshots !== null) {\n return this._snapshots;\n }\n upgradeStore(this.__store);\n const {\n _fetchManager\n } = this.__store;\n this._snapshots = this._recordArray[SOURCE].map(identifier => _fetchManager.createSnapshot(identifier));\n return this._snapshots;\n }\n}\nfunction assertIdentifierHasId(identifier) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Attempted to schedule a fetch for a record without an id.`);\n }\n })(identifier && identifier.id !== null) : {};\n}\nfunction iterateData(data, fn) {\n if (Array.isArray(data)) {\n return data.map(fn);\n } else {\n return fn(data, 0);\n }\n}\nfunction payloadIsNotBlank(adapterPayload) {\n if (Array.isArray(adapterPayload)) {\n return true;\n } else {\n return Object.keys(adapterPayload || {}).length !== 0;\n }\n}\n\n/**\n This is a helper method that validates a JSON API top-level document\n\n The format of a document is described here:\n http://jsonapi.org/format/#document-top-level\n\n @internal\n*/\nfunction validateDocumentStructure(doc) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n const errors = [];\n if (!doc || typeof doc !== 'object') {\n errors.push('Top level of a JSON API document must be an object');\n } else {\n if (!('data' in doc) && !('errors' in doc) && !('meta' in doc)) {\n errors.push('One or more of the following keys must be present: \"data\", \"errors\", \"meta\".');\n } else {\n if ('data' in doc && 'errors' in doc) {\n errors.push('Top level keys \"errors\" and \"data\" cannot both be present in a JSON API document');\n }\n }\n if ('data' in doc) {\n if (!(doc.data === null || Array.isArray(doc.data) || typeof doc.data === 'object')) {\n errors.push('data must be null, an object, or an array');\n }\n }\n if ('meta' in doc) {\n if (typeof doc.meta !== 'object') {\n errors.push('meta must be an object');\n }\n }\n if ('errors' in doc) {\n if (!Array.isArray(doc.errors)) {\n errors.push('errors must be an array');\n }\n }\n if ('links' in doc) {\n if (typeof doc.links !== 'object') {\n errors.push('links must be an object');\n }\n }\n if ('jsonapi' in doc) {\n if (typeof doc.jsonapi !== 'object') {\n errors.push('jsonapi must be an object');\n }\n }\n if ('included' in doc) {\n if (typeof doc.included !== 'object') {\n errors.push('included must be an array');\n }\n }\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Response must be normalized to a valid JSON API document:\\n\\t* ${errors.join('\\n\\t* ')}`);\n }\n })(errors.length === 0) : {};\n }\n}\nfunction normalizeResponseHelper(serializer, store, modelClass, payload, id, requestType) {\n const normalizedResponse = serializer ? serializer.normalizeResponse(store, modelClass, payload, id, requestType) : payload;\n validateDocumentStructure(normalizedResponse);\n return normalizedResponse;\n}\n\n/**\n @module @ember-data/store\n*/\n/**\n Snapshot is not directly instantiable.\n Instances are provided to a consuming application's\n adapters and serializers for certain requests.\n\n Snapshots are only available when using `@ember-data/legacy-compat`\n for legacy compatibility with adapters and serializers.\n\n @class Snapshot\n @public\n*/\nclass Snapshot {\n /**\n * @method constructor\n * @constructor\n * @private\n * @param options\n * @param identifier\n * @param _store\n */\n constructor(options, identifier, store) {\n this._store = store;\n this.__attributes = null;\n this._belongsToRelationships = Object.create(null);\n this._belongsToIds = Object.create(null);\n this._hasManyRelationships = Object.create(null);\n this._hasManyIds = Object.create(null);\n const hasRecord = !!store._instanceCache.peek(identifier);\n this.modelName = identifier.type;\n\n /**\n The unique RecordIdentifier associated with this Snapshot.\n @property identifier\n @public\n @type {StableRecordIdentifier}\n */\n this.identifier = identifier;\n\n /*\n If the we do not yet have a record, then we are\n likely a snapshot being provided to a find request, so we\n populate __attributes lazily. Else, to preserve the \"moment\n in time\" in which a snapshot is created, we greedily grab\n the values.\n */\n if (hasRecord) {\n this._attributes;\n }\n\n /**\n The id of the snapshot's underlying record\n Example\n ```javascript\n // store.push('post', { id: 1, author: 'Tomster', title: 'Ember.js rocks' });\n postSnapshot.id; // => '1'\n ```\n @property id\n @type {String}\n @public\n */\n this.id = identifier.id;\n\n /**\n A hash of adapter options\n @property adapterOptions\n @type {Object}\n @public\n */\n this.adapterOptions = options.adapterOptions;\n\n /**\n If `include` was passed to the options hash for the request, the value\n would be available here.\n @property include\n @type {String|Array}\n @public\n */\n this.include = options.include;\n\n /**\n The name of the type of the underlying record for this snapshot, as a string.\n @property modelName\n @type {String}\n @public\n */\n this.modelName = identifier.type;\n if (hasRecord) {\n const cache = this._store.cache;\n this._changedAttributes = cache.changedAttrs(identifier);\n }\n }\n\n /**\n The underlying record for this snapshot. Can be used to access methods and\n properties defined on the record.\n Example\n ```javascript\n let json = snapshot.record.toJSON();\n ```\n @property record\n @type {Model}\n @public\n */\n get record() {\n const record = this._store.peekRecord(this.identifier);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Record ${this.identifier.type} ${this.identifier.id} (${this.identifier.lid}) is not yet loaded and thus cannot be accessed from the Snapshot during serialization`);\n }\n })(record !== null) : {};\n return record;\n }\n get _attributes() {\n if (this.__attributes !== null) {\n return this.__attributes;\n }\n const attributes = this.__attributes = Object.create(null);\n const {\n identifier\n } = this;\n const attrs = this._store.schema.fields(identifier);\n const cache = this._store.cache;\n attrs.forEach((field, keyName) => {\n if (field.kind === 'attribute') {\n attributes[keyName] = cache.getAttr(identifier, keyName);\n }\n });\n return attributes;\n }\n get isNew() {\n const cache = this._store.cache;\n return cache?.isNew(this.identifier) || false;\n }\n\n /**\n Returns the value of an attribute.\n Example\n ```javascript\n // store.push('post', { id: 1, author: 'Tomster', title: 'Ember.js rocks' });\n postSnapshot.attr('author'); // => 'Tomster'\n postSnapshot.attr('title'); // => 'Ember.js rocks'\n ```\n Note: Values are loaded eagerly and cached when the snapshot is created.\n @method attr\n @param {String} keyName\n @return {Object} The attribute value or undefined\n @public\n */\n attr(keyName) {\n if (keyName in this._attributes) {\n return this._attributes[keyName];\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`Model '${this.identifier.lid}' has no attribute named '${keyName}' defined.`);\n }\n })() : {};\n }\n\n /**\n Returns all attributes and their corresponding values.\n Example\n ```javascript\n // store.push('post', { id: 1, author: 'Tomster', title: 'Ember.js rocks' });\n postSnapshot.attributes(); // => { author: 'Tomster', title: 'Ember.js rocks' }\n ```\n @method attributes\n @return {Object} All attributes of the current snapshot\n @public\n */\n attributes() {\n return {\n ...this._attributes\n };\n }\n\n /**\n Returns all changed attributes and their old and new values.\n Example\n ```javascript\n // store.push('post', { id: 1, author: 'Tomster', title: 'Ember.js rocks' });\n postModel.set('title', 'Ember.js rocks!');\n postSnapshot.changedAttributes(); // => { title: ['Ember.js rocks', 'Ember.js rocks!'] }\n ```\n @method changedAttributes\n @return {Object} All changed attributes of the current snapshot\n @public\n */\n changedAttributes() {\n const changedAttributes = Object.create(null);\n if (!this._changedAttributes) {\n return changedAttributes;\n }\n const changedAttributeKeys = Object.keys(this._changedAttributes);\n for (let i = 0, length = changedAttributeKeys.length; i < length; i++) {\n const key = changedAttributeKeys[i];\n changedAttributes[key] = this._changedAttributes[key].slice();\n }\n return changedAttributes;\n }\n\n /**\n Returns the current value of a belongsTo relationship.\n `belongsTo` takes an optional hash of options as a second parameter,\n currently supported options are:\n - `id`: set to `true` if you only want the ID of the related record to be\n returned.\n Example\n ```javascript\n // store.push('post', { id: 1, title: 'Hello World' });\n // store.createRecord('comment', { body: 'Lorem ipsum', post: post });\n commentSnapshot.belongsTo('post'); // => Snapshot\n commentSnapshot.belongsTo('post', { id: true }); // => '1'\n // store.push('comment', { id: 1, body: 'Lorem ipsum' });\n commentSnapshot.belongsTo('post'); // => undefined\n ```\n Calling `belongsTo` will return a new Snapshot as long as there's any known\n data for the relationship available, such as an ID. If the relationship is\n known but unset, `belongsTo` will return `null`. If the contents of the\n relationship is unknown `belongsTo` will return `undefined`.\n Note: Relationships are loaded lazily and cached upon first access.\n @method belongsTo\n @param {String} keyName\n @param {Object} [options]\n @public\n @return {(Snapshot|String|null|undefined)} A snapshot or ID of a known\n relationship or null if the relationship is known but unset. undefined\n will be returned if the contents of the relationship is unknown.\n */\n belongsTo(keyName, options) {\n const returnModeIsId = !!(options && options.id);\n let result;\n const store = this._store;\n if (returnModeIsId === true && keyName in this._belongsToIds) {\n return this._belongsToIds[keyName];\n }\n if (returnModeIsId === false && keyName in this._belongsToRelationships) {\n return this._belongsToRelationships[keyName];\n }\n const relationshipMeta = store.schema.fields({\n type: this.modelName\n }).get(keyName);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Model '${this.identifier.lid}' has no belongsTo relationship named '${keyName}' defined.`);\n }\n })(relationshipMeta && relationshipMeta.kind === 'belongsTo') : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`snapshot.belongsTo only supported when using the package @ember-data/graph`);\n }\n })(dependencySatisfies('@ember-data/graph', '*')) : {};\n const graphFor = importSync('@ember-data/graph/-private').graphFor;\n const {\n identifier\n } = this;\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n const relationship = graphFor(this._store).get(identifier, keyName);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You looked up the ${keyName} belongsTo relationship for { type: ${identifier.type}, id: ${identifier.id || ''}, lid: ${identifier.lid} but no such relationship was found.`);\n }\n })(relationship) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You looked up the ${keyName} belongsTo relationship for { type: ${identifier.type}, id: ${identifier.id || ''}, lid: ${identifier.lid} but that relationship is a hasMany.`);\n }\n })(relationship.definition.kind === 'belongsTo') : {};\n }\n const value = graphFor(this._store).getData(identifier, keyName);\n const data = value && value.data;\n const inverseIdentifier = data ? store.identifierCache.getOrCreateRecordIdentifier(data) : null;\n if (value && value.data !== undefined) {\n const cache = store.cache;\n if (inverseIdentifier && !cache.isDeleted(inverseIdentifier)) {\n if (returnModeIsId) {\n result = inverseIdentifier.id;\n } else {\n result = store._fetchManager.createSnapshot(inverseIdentifier);\n }\n } else {\n result = null;\n }\n }\n if (returnModeIsId) {\n this._belongsToIds[keyName] = result;\n } else {\n this._belongsToRelationships[keyName] = result;\n }\n return result;\n }\n\n /**\n Returns the current value of a hasMany relationship.\n `hasMany` takes an optional hash of options as a second parameter,\n currently supported options are:\n - `ids`: set to `true` if you only want the IDs of the related records to be\n returned.\n Example\n ```javascript\n // store.push('post', { id: 1, title: 'Hello World', comments: [2, 3] });\n postSnapshot.hasMany('comments'); // => [Snapshot, Snapshot]\n postSnapshot.hasMany('comments', { ids: true }); // => ['2', '3']\n // store.push('post', { id: 1, title: 'Hello World' });\n postSnapshot.hasMany('comments'); // => undefined\n ```\n Note: Relationships are loaded lazily and cached upon first access.\n @method hasMany\n @param {String} keyName\n @param {Object} [options]\n @public\n @return {(Array|undefined)} An array of snapshots or IDs of a known\n relationship or an empty array if the relationship is known but unset.\n undefined will be returned if the contents of the relationship is unknown.\n */\n hasMany(keyName, options) {\n const returnModeIsIds = !!(options && options.ids);\n let results;\n const cachedIds = this._hasManyIds[keyName];\n const cachedSnapshots = this._hasManyRelationships[keyName];\n if (returnModeIsIds === true && keyName in this._hasManyIds) {\n return cachedIds;\n }\n if (returnModeIsIds === false && keyName in this._hasManyRelationships) {\n return cachedSnapshots;\n }\n const store = this._store;\n const relationshipMeta = store.schema.fields({\n type: this.modelName\n }).get(keyName);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Model '${this.identifier.lid}' has no hasMany relationship named '${keyName}' defined.`);\n }\n })(relationshipMeta && relationshipMeta.kind === 'hasMany') : {};\n\n // TODO @runspired it seems this code branch would not work with CUSTOM_MODEL_CLASSes\n // this check is not a regression in behavior because relationships don't currently\n // function without access to intimate API contracts between RecordData and Model.\n // This is a requirement we should fix as soon as the relationship layer does not require\n // this intimate API usage.\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`snapshot.hasMany only supported when using the package @ember-data/graph`);\n }\n })(dependencySatisfies('@ember-data/graph', '*')) : {};\n const graphFor = importSync('@ember-data/graph/-private').graphFor;\n const {\n identifier\n } = this;\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n const relationship = graphFor(this._store).get(identifier, keyName);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You looked up the ${keyName} hasMany relationship for { type: ${identifier.type}, id: ${identifier.id || ''}, lid: ${identifier.lid} but no such relationship was found.`);\n }\n })(relationship) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You looked up the ${keyName} hasMany relationship for { type: ${identifier.type}, id: ${identifier.id || ''}, lid: ${identifier.lid} but that relationship is a belongsTo.`);\n }\n })(relationship.definition.kind === 'hasMany') : {};\n }\n const value = graphFor(this._store).getData(identifier, keyName);\n if (value.data) {\n results = [];\n value.data.forEach(member => {\n const inverseIdentifier = store.identifierCache.getOrCreateRecordIdentifier(member);\n const cache = store.cache;\n if (!cache.isDeleted(inverseIdentifier)) {\n if (returnModeIsIds) {\n results.push(inverseIdentifier.id);\n } else {\n results.push(store._fetchManager.createSnapshot(inverseIdentifier));\n }\n }\n });\n }\n\n // we assign even if `undefined` so that we don't reprocess the relationship\n // on next access. This works with the `keyName in` checks above.\n if (returnModeIsIds) {\n this._hasManyIds[keyName] = results;\n } else {\n this._hasManyRelationships[keyName] = results;\n }\n return results;\n }\n\n /**\n Iterates through all the attributes of the model, calling the passed\n function on each attribute.\n Example\n ```javascript\n snapshot.eachAttribute(function(name, meta) {\n // ...\n });\n ```\n @method eachAttribute\n @param {Function} callback the callback to execute\n @param {Object} [binding] the value to which the callback's `this` should be bound\n @public\n */\n eachAttribute(callback, binding) {\n const fields = this._store.schema.fields(this.identifier);\n fields.forEach((field, key) => {\n if (field.kind === 'attribute') {\n callback.call(binding, key, field);\n }\n });\n }\n\n /**\n Iterates through all the relationships of the model, calling the passed\n function on each relationship.\n Example\n ```javascript\n snapshot.eachRelationship(function(name, relationship) {\n // ...\n });\n ```\n @method eachRelationship\n @param {Function} callback the callback to execute\n @param {Object} [binding] the value to which the callback's `this` should be bound\n @public\n */\n eachRelationship(callback, binding) {\n const fields = this._store.schema.fields(this.identifier);\n fields.forEach((field, key) => {\n if (field.kind === 'belongsTo' || field.kind === 'hasMany') {\n callback.call(binding, key, field);\n }\n });\n }\n\n /**\n Serializes the snapshot using the serializer for the model.\n Example\n ```app/adapters/application.js\n import Adapter from '@ember-data/adapter';\n export default Adapter.extend({\n createRecord(store, type, snapshot) {\n let data = snapshot.serialize({ includeId: true });\n let url = `/${type.modelName}`;\n return fetch(url, {\n method: 'POST',\n body: data,\n }).then((response) => response.json())\n }\n });\n ```\n @method serialize\n @param {Object} options\n @return {Object} an object whose values are primitive JSON values only\n @public\n */\n serialize(options) {\n upgradeStore(this._store);\n const serializer = this._store.serializerFor(this.modelName);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot serialize record, no serializer found`);\n }\n })(serializer) : {};\n return serializer.serialize(this, options);\n }\n}\nconst SaveOp = getOrSetGlobal('SaveOp', Symbol('SaveOp'));\nclass FetchManager {\n // fetches pending in the runloop, waiting to be coalesced\n\n constructor(store) {\n this._store = store;\n // used to keep track of all the find requests that need to be coalesced\n this._pendingFetch = new Map();\n this.requestCache = store.getRequestStateService();\n this.isDestroyed = false;\n }\n createSnapshot(identifier, options = {}) {\n return new Snapshot(options, identifier, this._store);\n }\n\n /**\n This method is called by `record.save`, and gets passed a\n resolver for the promise that `record.save` returns.\n It schedules saving to happen at the end of the run loop.\n @internal\n */\n scheduleSave(identifier, options) {\n const resolver = createDeferred();\n const query = {\n op: 'saveRecord',\n recordIdentifier: identifier,\n options\n };\n const queryRequest = {\n data: [query]\n };\n const snapshot = this.createSnapshot(identifier, options);\n const pendingSaveItem = {\n snapshot: snapshot,\n resolver: resolver,\n identifier,\n options,\n queryRequest\n };\n const monitored = this.requestCache._enqueue(resolver.promise, pendingSaveItem.queryRequest);\n _flushPendingSave(this._store, pendingSaveItem);\n return monitored;\n }\n scheduleFetch(identifier, options, request) {\n const query = {\n op: 'findRecord',\n recordIdentifier: identifier,\n options\n };\n const queryRequest = {\n data: [query]\n };\n const pendingFetch = this.getPendingFetch(identifier, options);\n if (pendingFetch) {\n return pendingFetch;\n }\n const modelName = identifier.type;\n const resolver = createDeferred();\n const pendingFetchItem = {\n identifier,\n resolver,\n options,\n queryRequest\n };\n const resolverPromise = resolver.promise;\n const store = this._store;\n const isInitialLoad = !store._instanceCache.recordIsLoaded(identifier); // we don't use isLoading directly because we are the request\n\n const monitored = this.requestCache._enqueue(resolverPromise, pendingFetchItem.queryRequest);\n let promise = monitored.then(payload => {\n // ensure that regardless of id returned we assign to the correct record\n if (payload.data && !Array.isArray(payload.data)) {\n payload.data.lid = identifier.lid;\n }\n\n // additional data received in the payload\n // may result in the merging of identifiers (and thus records)\n const potentiallyNewIm = store._push(payload, options.reload);\n if (potentiallyNewIm && !Array.isArray(potentiallyNewIm)) {\n return potentiallyNewIm;\n }\n return identifier;\n }, error => {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Async Leak Detected: Expected the store to not be destroyed`);\n }\n })(!store.isDestroyed) : {};\n const cache = store.cache;\n if (!cache || cache.isEmpty(identifier) || isInitialLoad) {\n let isReleasable = true;\n if (macroCondition(dependencySatisfies('@ember-data/graph', '*'))) {\n if (!cache) {\n const graphFor = importSync('@ember-data/graph/-private').graphFor;\n const graph = graphFor(store);\n isReleasable = graph.isReleasable(identifier);\n if (!isReleasable) {\n graph.unload(identifier, true);\n }\n }\n }\n if (cache || isReleasable) {\n store._enableAsyncFlush = true;\n store._instanceCache.unloadRecord(identifier);\n store._enableAsyncFlush = null;\n }\n }\n throw error;\n });\n if (this._pendingFetch.size === 0) {\n void new Promise(resolve => setTimeout(resolve, 0)).then(() => {\n this.flushAllPendingFetches();\n });\n }\n const fetchesByType = this._pendingFetch;\n let fetchesById = fetchesByType.get(modelName);\n if (!fetchesById) {\n fetchesById = new Map();\n fetchesByType.set(modelName, fetchesById);\n }\n let requestsForIdentifier = fetchesById.get(identifier);\n if (!requestsForIdentifier) {\n requestsForIdentifier = [];\n fetchesById.set(identifier, requestsForIdentifier);\n }\n requestsForIdentifier.push(pendingFetchItem);\n if (macroCondition(getGlobalConfig().WarpDrive.env.TESTING)) {\n if (!request.disableTestWaiter) {\n const {\n waitForPromise\n } = importSync('@ember/test-waiters');\n promise = waitForPromise(promise);\n }\n }\n pendingFetchItem.promise = promise;\n return promise;\n }\n getPendingFetch(identifier, options) {\n const pendingFetches = this._pendingFetch.get(identifier.type)?.get(identifier);\n\n // We already have a pending fetch for this\n if (pendingFetches) {\n const matchingPendingFetch = pendingFetches.find(fetch => isSameRequest(options, fetch.options));\n if (matchingPendingFetch) {\n return matchingPendingFetch.promise;\n }\n }\n }\n flushAllPendingFetches() {\n if (this.isDestroyed) {\n return;\n }\n const store = this._store;\n this._pendingFetch.forEach((fetchItem, type) => _flushPendingFetchForType(store, fetchItem, type));\n this._pendingFetch.clear();\n }\n fetchDataIfNeededForIdentifier(identifier, options = {}, request) {\n // pre-loading will change the isEmpty value\n const isEmpty = _isEmpty(this._store._instanceCache, identifier);\n const isLoading = _isLoading(this._store._instanceCache, identifier);\n let promise;\n if (isEmpty) {\n assertIdentifierHasId(identifier);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n promise = this.scheduleFetch(identifier, Object.assign({}, options, {\n reload: true\n }), request);\n } else {\n options.reload = true;\n promise = this.scheduleFetch(identifier, options, request);\n }\n } else if (isLoading) {\n promise = this.getPendingFetch(identifier, options);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected to find a pending request for a record in the loading state, but found none`);\n }\n })(promise) : {};\n } else {\n promise = Promise.resolve(identifier);\n }\n return promise;\n }\n destroy() {\n this.isDestroyed = true;\n }\n}\nfunction _isEmpty(instanceCache, identifier) {\n const cache = instanceCache.cache;\n if (!cache) {\n return true;\n }\n const isNew = cache.isNew(identifier);\n const isDeleted = cache.isDeleted(identifier);\n const isEmpty = cache.isEmpty(identifier);\n return (!isNew || isDeleted) && isEmpty;\n}\nfunction _isLoading(cache, identifier) {\n const req = cache.store.getRequestStateService();\n // const fulfilled = req.getLastRequestForRecord(identifier);\n const isLoaded = cache.recordIsLoaded(identifier);\n return !isLoaded &&\n // fulfilled === null &&\n req.getPendingRequestsForRecord(identifier).some(r => r.type === 'query');\n}\nfunction includesSatisfies(current, existing) {\n // if we have no includes we are good\n if (!current?.length) {\n return true;\n }\n\n // if we are here we have includes,\n // and if existing has no includes then we will need a new request\n if (!existing?.length) {\n return false;\n }\n const arrCurrent = (Array.isArray(current) ? current : current.split(',')).sort();\n const arrExisting = (Array.isArray(existing) ? existing : existing.split(',')).sort();\n\n // includes are identical\n if (arrCurrent.join(',') === arrExisting.join(',')) {\n return true;\n }\n\n // if all of current includes are in existing includes then we are good\n // so if we find one that is not in existing then we need a new request\n for (let i = 0; i < arrCurrent.length; i++) {\n if (!arrExisting.includes(arrCurrent[i])) {\n return false;\n }\n }\n return true;\n}\nfunction optionsSatisfies(current, existing) {\n return !current || current === existing || Object.keys(current).length === 0;\n}\n\n// this function helps resolve whether we have a pending request that we should use instead\nfunction isSameRequest(options = {}, existingOptions = {}) {\n return optionsSatisfies(options.adapterOptions, existingOptions.adapterOptions) && includesSatisfies(options.include, existingOptions.include);\n}\nfunction _findMany(store, adapter, modelName, snapshots) {\n const modelClass = store.modelFor(modelName); // `adapter.findMany` gets the modelClass still\n const promise = Promise.resolve().then(() => {\n const ids = snapshots.map(s => s.id);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot fetch a record without an id`);\n }\n })(ids.every(v => v !== null)) : {};\n // eslint-disable-next-line @typescript-eslint/unbound-method\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected this adapter to implement findMany for coalescing`);\n }\n })(adapter.findMany) : {};\n const ret = adapter.findMany(store, modelClass, ids, snapshots);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('adapter.findMany returned undefined, this was very likely a mistake');\n }\n })(ret !== undefined) : {};\n return ret;\n });\n return promise.then(adapterPayload => {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You made a 'findMany' request for '${modelName}' records with ids '[${snapshots.map(s => s.id).join(',')}]', but the adapter's response did not have any data`);\n }\n })(!!payloadIsNotBlank(adapterPayload)) : {};\n const serializer = store.serializerFor(modelName);\n const payload = normalizeResponseHelper(serializer, store, modelClass, adapterPayload, null, 'findMany');\n return payload;\n });\n}\nfunction rejectFetchedItems(fetchMap, snapshots, error) {\n for (let i = 0, l = snapshots.length; i < l; i++) {\n const snapshot = snapshots[i];\n const pair = fetchMap.get(snapshot);\n if (pair) {\n pair.resolver.reject(error || new Error(`Expected: '<${snapshot.modelName}:${snapshot.id}>' to be present in the adapter provided payload, but it was not found.`));\n }\n }\n}\nfunction handleFoundRecords(store, fetchMap, snapshots, coalescedPayload) {\n /*\n It is possible that the same ID is included multiple times\n via multiple snapshots. This happens when more than one\n options hash was supplied, each of which must be uniquely\n accounted for.\n However, since we can't map from response to a specific\n options object, we resolve all snapshots by id with\n the first response we see.\n */\n const snapshotsById = new Map();\n for (let i = 0; i < snapshots.length; i++) {\n const id = snapshots[i].id;\n let snapshotGroup = snapshotsById.get(id);\n if (!snapshotGroup) {\n snapshotGroup = [];\n snapshotsById.set(id, snapshotGroup);\n }\n snapshotGroup.push(snapshots[i]);\n }\n const included = Array.isArray(coalescedPayload.included) ? coalescedPayload.included : [];\n\n // resolve found records\n const resources = coalescedPayload.data;\n for (let i = 0, l = resources.length; i < l; i++) {\n const resource = resources[i];\n const snapshotGroup = snapshotsById.get(resource.id);\n snapshotsById.delete(resource.id);\n if (!snapshotGroup) {\n // TODO consider whether this should be a deprecation/assertion\n included.push(resource);\n } else {\n snapshotGroup.forEach(snapshot => {\n const pair = fetchMap.get(snapshot);\n const resolver = pair.resolver;\n resolver.resolve({\n data: resource\n });\n });\n }\n }\n if (included.length > 0) {\n store._push({\n data: null,\n included\n }, true);\n }\n if (snapshotsById.size === 0) {\n return;\n }\n\n // reject missing records\n const rejected = [];\n snapshotsById.forEach(snapshotArray => {\n rejected.push(...snapshotArray);\n });\n warn('Ember Data expected to find records with the following ids in the adapter response from findMany but they were missing: [ \"' + [...snapshotsById.values()].map(r => r[0].id).join('\", \"') + '\" ]', {\n id: 'ds.store.missing-records-from-adapter'\n });\n rejectFetchedItems(fetchMap, rejected);\n}\nfunction _fetchRecord(store, adapter, fetchItem) {\n const identifier = fetchItem.identifier;\n const modelName = identifier.type;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You tried to find a record but you have no adapter (for ${modelName})`);\n }\n })(adapter) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You tried to find a record but your adapter (for ${modelName}) does not implement 'findRecord'`);\n }\n })(typeof adapter.findRecord === 'function') : {};\n const snapshot = store._fetchManager.createSnapshot(identifier, fetchItem.options);\n const klass = store.modelFor(identifier.type);\n const id = identifier.id;\n let promise = Promise.resolve().then(() => {\n return adapter.findRecord(store, klass, identifier.id, snapshot);\n });\n promise = promise.then(adapterPayload => {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Async Leak Detected: Expected the store to not be destroyed`);\n }\n })(!(store.isDestroyed || store.isDestroying)) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You made a 'findRecord' request for a '${modelName}' with id '${id}', but the adapter's response did not have any data`);\n }\n })(!!payloadIsNotBlank(adapterPayload)) : {};\n const serializer = store.serializerFor(modelName);\n const payload = normalizeResponseHelper(serializer, store, klass, adapterPayload, id, 'findRecord');\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Ember Data expected the primary data returned from a 'findRecord' response to be an object but instead it found an array.`);\n }\n })(!Array.isArray(payload.data)) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`The 'findRecord' request for ${modelName}:${id} resolved indicating success but contained no primary data. To indicate a 404 not found you should either reject the promise returned by the adapter's findRecord method or throw a NotFoundError.`);\n }\n })('data' in payload && payload.data !== null && typeof payload.data === 'object') : {};\n warn(`You requested a record of type '${modelName}' with id '${id}' but the adapter returned a payload with primary data having an id of '${payload.data.id}'. Use 'store.findRecord()' when the requested id is the same as the one returned by the adapter. In other cases use 'store.queryRecord()' instead.`, coerceId(payload.data.id) === coerceId(id), {\n id: 'ds.store.findRecord.id-mismatch'\n });\n return payload;\n });\n fetchItem.resolver.resolve(promise);\n}\nfunction _processCoalescedGroup(store, fetchMap, group, adapter, modelName) {\n if (group.length > 1) {\n _findMany(store, adapter, modelName, group).then(payloads => {\n handleFoundRecords(store, fetchMap, group, payloads);\n }).catch(error => {\n rejectFetchedItems(fetchMap, group, error);\n });\n } else if (group.length === 1) {\n _fetchRecord(store, adapter, fetchMap.get(group[0]));\n } else {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(\"You cannot return an empty array from adapter's method groupRecordsForFindMany\");\n }\n })() : {};\n }\n}\nfunction _flushPendingFetchForType(store, pendingFetchMap, modelName) {\n const adapter = store.adapterFor(modelName);\n const shouldCoalesce = !!adapter.findMany && adapter.coalesceFindRequests;\n if (shouldCoalesce) {\n const pendingFetchItems = [];\n pendingFetchMap.forEach((requestsForIdentifier, identifier) => {\n if (requestsForIdentifier.length > 1) {\n return;\n }\n\n // remove this entry from the map so it's not processed again\n pendingFetchMap.delete(identifier);\n pendingFetchItems.push(requestsForIdentifier[0]);\n });\n const totalItems = pendingFetchItems.length;\n if (totalItems > 1) {\n const snapshots = new Array(totalItems);\n const fetchMap = new Map();\n for (let i = 0; i < totalItems; i++) {\n const fetchItem = pendingFetchItems[i];\n snapshots[i] = store._fetchManager.createSnapshot(fetchItem.identifier, fetchItem.options);\n fetchMap.set(snapshots[i], fetchItem);\n }\n let groups;\n if (adapter.groupRecordsForFindMany) {\n groups = adapter.groupRecordsForFindMany(store, snapshots);\n } else {\n groups = [snapshots];\n }\n for (let i = 0, l = groups.length; i < l; i++) {\n _processCoalescedGroup(store, fetchMap, groups[i], adapter, modelName);\n }\n } else if (totalItems === 1) {\n _fetchRecord(store, adapter, pendingFetchItems[0]);\n }\n }\n pendingFetchMap.forEach(pendingFetchItems => {\n pendingFetchItems.forEach(pendingFetchItem => {\n _fetchRecord(store, adapter, pendingFetchItem);\n });\n });\n}\nfunction _flushPendingSave(store, pending) {\n const {\n snapshot,\n resolver,\n identifier,\n options\n } = pending;\n const adapter = store.adapterFor(identifier.type);\n const operation = options[SaveOp];\n const modelName = snapshot.modelName;\n const modelClass = store.modelFor(modelName);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You tried to update a record but you have no adapter (for ${modelName})`);\n }\n })(adapter) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You tried to update a record but your adapter (for ${modelName}) does not implement '${operation}'`);\n }\n })(typeof adapter[operation] === 'function') : {};\n let promise = Promise.resolve().then(() => adapter[operation](store, modelClass, snapshot));\n const serializer = store.serializerFor(modelName);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Your adapter's '${operation}' method must return a value, but it returned 'undefined'`);\n }\n })(promise !== undefined) : {};\n promise = promise.then(adapterPayload => {\n if (adapterPayload) {\n return normalizeResponseHelper(serializer, store, modelClass, adapterPayload, snapshot.id, operation);\n }\n });\n resolver.resolve(promise);\n}\n\n/**\n * Utilities - often temporary - for maintaining backwards compatibility with\n * older parts of EmberData.\n *\n @module @ember-data/legacy-compat\n @main @ember-data/legacy-compat\n*/\nfunction upgradeStore(store) {}\nexport { FetchManager as F, SaveOp as S, assertIdentifierHasId as a, SnapshotRecordArray as b, Snapshot as c, iterateData as i, normalizeResponseHelper as n, payloadIsNotBlank as p, upgradeStore as u };","import { setOwner, getOwner } from '@ember/application';\nimport { setRecordIdentifier, StoreMap, setCacheFor } from '@ember-data/store/-private';\nimport { g as getModelFactory } from \"./schema-provider-Cgpcwfn7.js\";\nimport { n as normalizeModelName } from \"./model-BFnMMaye.js\";\nimport { macroCondition, getGlobalConfig } from '@embroider/macros';\nfunction instantiateRecord(identifier, createRecordArgs) {\n const type = identifier.type;\n const cache = this.cache;\n // TODO deprecate allowing unknown args setting\n const createOptions = {\n _createProps: createRecordArgs,\n // TODO @deprecate consider deprecating accessing record properties during init which the below is necessary for\n _secretInit: {\n identifier,\n cache,\n store: this,\n cb: secretInit\n }\n };\n\n // ensure that `getOwner(this)` works inside a model instance\n setOwner(createOptions, getOwner(this));\n const factory = getModelFactory(this, type);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`No model was found for '${type}'`);\n }\n })(factory) : {};\n return factory.class.create(createOptions);\n}\nfunction teardownRecord(record) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected to receive an instance of Model from @ember-data/model. If using a custom model make sure you implement teardownRecord`);\n }\n })('destroy' in record) : {};\n record.destroy();\n}\nfunction modelFor(modelName) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Attempted to call store.modelFor(), but the store instance has already been destroyed.`);\n }\n })(!this.isDestroyed && !this.isDestroying) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a model name to the store's modelFor method`);\n }\n })(modelName) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Please pass a proper model name to the store's modelFor method`);\n }\n })(typeof modelName === 'string' && modelName.length) : {};\n const type = normalizeModelName(modelName);\n const maybeFactory = getModelFactory(this, type);\n const klass = maybeFactory && maybeFactory.class ? maybeFactory.class : null;\n const ignoreType = !klass || !klass.isModel || this._forceShim;\n if (!ignoreType) {\n return klass;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`No model was found for '${type}' and no schema handles the type`);\n }\n })(this.schema.hasResource({\n type\n })) : {};\n}\nfunction secretInit(record, cache, identifier, store) {\n setRecordIdentifier(record, identifier);\n StoreMap.set(record, store);\n setCacheFor(record, cache);\n}\nexport { instantiateRecord as i, modelFor as m, teardownRecord as t };","import { computed } from '@ember/object';\nimport { recordIdentifierFor } from '@ember-data/store';\nimport { peekCache } from '@ember-data/store/-private';\nimport { k as isElementDescriptor, n as normalizeModelName, l as lookupLegacySupport } from \"./model-BFnMMaye.js\";\nimport { macroCondition, getGlobalConfig } from '@embroider/macros';\nimport { warn, deprecate } from '@ember/debug';\nimport { RecordStore } from '@warp-drive/core-types/symbols';\nimport { singularize, dasherize } from '@ember-data/request-utils/string';\n\n/**\n @module @ember-data/model\n*/\nfunction _attr(type, options) {\n if (typeof type === 'object') {\n options = type;\n type = undefined;\n } else {\n options = options || {};\n }\n const meta = {\n type: type,\n kind: 'attribute',\n isAttribute: true,\n options: options,\n key: null\n };\n return computed({\n get(key) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (['currentState'].includes(key)) {\n throw new Error(`'${key}' is a reserved property name on instances of classes extending Model. Please choose a different property name for your attr on ${this.constructor.toString()}`);\n }\n }\n if (this.isDestroyed || this.isDestroying) {\n return;\n }\n return peekCache(this).getAttr(recordIdentifierFor(this), key);\n },\n set(key, value) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (['currentState'].includes(key)) {\n throw new Error(`'${key}' is a reserved property name on instances of classes extending Model. Please choose a different property name for your attr on ${this.constructor.toString()}`);\n }\n }\n const identifier = recordIdentifierFor(this);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Attempted to set '${key}' on the deleted record ${identifier.type}:${identifier.id} (${identifier.lid})`);\n }\n })(!this.currentState.isDeleted) : {};\n const cache = peekCache(this);\n const currentValue = cache.getAttr(identifier, key);\n if (currentValue !== value) {\n cache.setAttr(identifier, key, value);\n if (!this.isValid) {\n const {\n errors\n } = this;\n if (errors.get(key)) {\n errors.remove(key);\n this.currentState.cleanErrorRequests();\n }\n }\n }\n return value;\n }\n }).meta(meta);\n}\n\n// NOTE: Usage of Explicit ANY\n// -------------------------------------------------------------------\n// any is required here because we are the maximal not the minimal\n// subset of options allowed. If we used unknown, object, or\n// Record we would get type errors when we try to\n// assert against a more specific implementation with precise options.\n// -------------------------------------------------------------------\n\n// see note on Explicit ANY above\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\n/**\n * The return type of `void` is a lie to appease TypeScript. The actual return type\n * is a descriptor, but typescript incorrectly insists that decorator functions return\n * `void` or `any`.\n *\n * @typedoc\n */\n\n/**\n `attr` defines an attribute on a [Model](/ember-data/release/classes/Model).\n By default, attributes are passed through as-is, however you can specify an\n optional type to have the value automatically transformed.\n EmberData ships with four basic transform types: `string`, `number`,\n `boolean` and `date`. You can define your own transforms by subclassing\n [Transform](/ember-data/release/classes/Transform).\n\n Note that you cannot use `attr` to define an attribute of `id`.\n\n `attr` takes an optional hash as a second parameter, currently\n supported options are:\n\n - `defaultValue`: Pass a string or a function to be called to set the attribute\n to a default value if and only if the key is absent from the payload response.\n\n Example\n\n ```app/models/user.js\n import Model, { attr } from '@ember-data/model';\n\n export default class UserModel extends Model {\n @attr('string') username;\n @attr('string') email;\n @attr('boolean', { defaultValue: false }) verified;\n }\n ```\n\n Default value can also be a function. This is useful it you want to return\n a new object for each attribute.\n\n ```app/models/user.js\n import Model, { attr } from '@ember-data/model';\n\n export default class UserModel extends Model {\n @attr('string') username;\n @attr('string') email;\n\n @attr({\n defaultValue() {\n return {};\n }\n })\n settings;\n }\n ```\n\n The `options` hash is passed as second argument to a transforms'\n `serialize` and `deserialize` method. This allows to configure a\n transformation and adapt the corresponding value, based on the config:\n\n ```app/models/post.js\n import Model, { attr } from '@ember-data/model';\n\n export default class PostModel extends Model {\n @attr('text', {\n uppercase: true\n })\n text;\n }\n ```\n\n ```app/transforms/text.js\n export default class TextTransform {\n serialize(value, options) {\n if (options.uppercase) {\n return value.toUpperCase();\n }\n\n return value;\n }\n\n deserialize(value) {\n return value;\n }\n\n static create() {\n return new this();\n }\n }\n ```\n\n @method attr\n @public\n @static\n @for @ember-data/model\n @param {String|Object} type the attribute type\n @param {Object} options a hash of options\n @return {Attribute}\n*/\n\n// see note on DataDecorator for why void\nfunction attr(type, options, desc) {\n const args = [type, options, desc];\n // see note on DataDecorator for why void\n return isElementDescriptor(args) ? _attr()(...args) : _attr(type, options);\n}\n\n// get: () => getT;\n// // set: (value: Awaited) => void;\n// set: (value: getT) => void;\n// // init: () => getT;\n// };\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\n// BelongsToDecoratorObject;\n\nfunction _belongsTo(type, options) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected options.async from @belongsTo('${type}', options) to be a boolean`);\n }\n })(options && typeof options.async === 'boolean') : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected options.inverse from @belongsTo('${type}', options) to be either null or the string type of the related resource.`);\n }\n })(options.inverse === null || typeof options.inverse === 'string' && options.inverse.length > 0) : {};\n const meta = {\n type: normalizeModelName(type),\n options: options,\n kind: 'belongsTo',\n name: ''\n };\n return computed({\n get(key) {\n // this is a legacy behavior we may not carry into a new model setup\n // it's better to error on disconnected records so users find errors\n // in their logic.\n if (this.isDestroying || this.isDestroyed) {\n return null;\n }\n const support = lookupLegacySupport(this);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (['currentState'].includes(key)) {\n throw new Error(`'${key}' is a reserved property name on instances of classes extending Model. Please choose a different property name for your belongsTo on ${this.constructor.toString()}`);\n }\n if (Object.prototype.hasOwnProperty.call(options, 'serialize')) {\n warn(`You provided a serialize option on the \"${key}\" property in the \"${support.identifier.type}\" class, this belongs in the serializer. See Serializer and it's implementations https://api.emberjs.com/ember-data/release/classes/Serializer`, false, {\n id: 'ds.model.serialize-option-in-belongs-to'\n });\n }\n if (Object.prototype.hasOwnProperty.call(options, 'embedded')) {\n warn(`You provided an embedded option on the \"${key}\" property in the \"${support.identifier.type}\" class, this belongs in the serializer. See EmbeddedRecordsMixin https://api.emberjs.com/ember-data/release/classes/EmbeddedRecordsMixin`, false, {\n id: 'ds.model.embedded-option-in-belongs-to'\n });\n }\n }\n return support.getBelongsTo(key);\n },\n set(key, value) {\n const support = lookupLegacySupport(this);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (['currentState'].includes(key)) {\n throw new Error(`'${key}' is a reserved property name on instances of classes extending Model. Please choose a different property name for your belongsTo on ${this.constructor.toString()}`);\n }\n }\n this[RecordStore]._join(() => {\n support.setDirtyBelongsTo(key, value);\n });\n return support.getBelongsTo(key);\n }\n }).meta(meta);\n}\n\n/**\n `belongsTo` is used to define One-To-One and One-To-Many, and One-To-None\n relationships on a [Model](/ember-data/release/classes/Model).\n\n `belongsTo` takes a configuration hash as a second parameter, currently\n supported options are:\n\n - `async`: (*required*) A boolean value used to declare whether this is a sync (false) or async (true) relationship.\n - `inverse`: (*required*) A string used to identify the inverse property on a related model, or `null`.\n - `polymorphic`: (*optional*) A boolean value to mark the relationship as polymorphic\n - `as`: (*optional*) A string used to declare the abstract type \"this\" record satisfies for polymorphism.\n\n ### Examples\n\n To declare a **one-to-many** (or many-to-many) relationship, use\n `belongsTo` in combination with `hasMany`:\n\n ```js\n // app/models/comment.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class Comment extends Model {\n @belongsTo('post', { async: false, inverse: 'comments' }) post;\n }\n\n // app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class Post extends Model {\n @hasMany('comment', { async: false, inverse: 'post' }) comments;\n }\n ```\n\n To declare a **one-to-one** relationship with managed inverses, use `belongsTo` for both sides:\n\n ```js\n // app/models/author.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class Author extends Model {\n @belongsTo('address', { async: true, inverse: 'owner' }) address;\n }\n\n // app/models/address.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class Address extends Model {\n @belongsTo('author', { async: true, inverse: 'address' }) owner;\n }\n ```\n\n To declare a **one-to-one** relationship without managed inverses, use `belongsTo` for both sides\n with `null` as the inverse:\n\n ```js\n // app/models/author.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class Author extends Model {\n @belongsTo('address', { async: true, inverse: null }) address;\n }\n\n // app/models/address.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class Address extends Model {\n @belongsTo('author', { async: true, inverse: null }) owner;\n }\n ```\n\n To declare a one-to-none relationship between two models, use\n `belongsTo` with inverse set to `null` on just one side::\n\n ```js\n // app/models/person.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class Person extends Model {\n @belongsTo('person', { async: false, inverse: null }) bestFriend;\n }\n ```\n\n #### Sync vs Async Relationships\n\n EmberData fulfills relationships using resource data available in\n the cache.\n\n Sync relationships point directly to the known related resources.\n\n When a relationship is declared as async, if any of the known related\n resources have not been loaded, they will be fetched. The property\n on the record when accessed provides a promise that resolves once\n all resources are loaded.\n\n Async relationships may take advantage of links. On access, if the related\n link has not been loaded, or if any known resources are not available in\n the cache, the fresh state will be fetched using the link.\n\n In contrast to async relationship, accessing a sync relationship\n will error on access when any of the known related resources have\n not been loaded.\n\n If you are using `links` with sync relationships, you have to use\n the BelongsTo reference API to fetch or refresh related resources\n that aren't loaded. For instance, for a `bestFriend` relationship:\n\n ```js\n person.belongsTo('bestFriend').reload();\n ```\n\n #### Polymorphic Relationships\n\n To declare a polymorphic relationship, use `hasMany` with the `polymorphic`\n option set to `true`:\n\n ```js\n // app/models/comment.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class Comment extends Model {\n @belongsTo('commentable', { async: false, inverse: 'comments', polymorphic: true }) parent;\n }\n ```\n\n `'commentable'` here is referred to as the \"abstract type\" for the polymorphic\n relationship.\n\n Polymorphic relationships with `inverse: null` will accept any type of record as their content.\n Polymorphic relationships with `inverse` set to a string will only accept records with a matching\n inverse relationships declaring itself as satisfying the abstract type.\n\n Below, 'as' is used to declare the that 'post' record satisfies the abstract type 'commentable'\n for this relationship.\n\n ```js\n // app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class Post extends Model {\n @hasMany('comment', { async: false, inverse: 'parent', as: 'commentable' }) comments;\n }\n ```\n\n Note: every Model that declares an inverse to a polymorphic relationship must\n declare itself exactly the same. This is because polymorphism is based on structural\n traits.\n\n Polymorphic to polymorphic relationships are supported. Both sides of the relationship\n must be declared as polymorphic, and the `as` option must be used to declare the abstract\n type each record satisfies on both sides.\n\n @method belongsTo\n @public\n @static\n @for @ember-data/model\n @param {string} type (optional) the name of the related resource\n @param {object} options (optional) a hash of options\n @return {PropertyDescriptor} relationship\n*/\n\n// export function belongsTo, T extends Awaited = Awaited>(\n// type: TypeFromInstance>,\n// options: RelationshipOptions\n// ): RelationshipDecorator;\n\nfunction belongsTo(type, options) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`belongsTo must be invoked with a type and options. Did you mean \\`@belongsTo(${type}, { async: false, inverse: null })\\`?`);\n }\n })(!isElementDescriptor(arguments)) : {};\n }\n return _belongsTo(type, options);\n}\n\n/**\n @module @ember-data/model\n*/\nfunction normalizeType(type) {\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_NON_STRICT_TYPES)) {\n const result = singularize(dasherize(type));\n deprecate(`The resource type '${type}' is not normalized. Update your application code to use '${result}' instead of '${type}'.`, result === type, {\n id: 'ember-data:deprecate-non-strict-types',\n until: '6.0',\n for: 'ember-data',\n since: {\n available: '5.3',\n enabled: '5.3'\n }\n });\n return result;\n }\n return type;\n}\nfunction _hasMany(type, options) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected hasMany options.async to be a boolean`);\n }\n })(options && typeof options.async === 'boolean') : {};\n\n // Metadata about relationships is stored on the meta of\n // the relationship. This is used for introspection and\n // serialization. Note that `key` is populated lazily\n // the first time the CP is called.\n const meta = {\n type: normalizeType(type),\n options,\n kind: 'hasMany',\n name: ''\n };\n return computed({\n get(key) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (['currentState'].includes(key)) {\n throw new Error(`'${key}' is a reserved property name on instances of classes extending Model. Please choose a different property name for your hasMany on ${this.constructor.toString()}`);\n }\n }\n if (this.isDestroying || this.isDestroyed) {\n return [];\n }\n return lookupLegacySupport(this).getHasMany(key);\n },\n set(key, records) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (['currentState'].includes(key)) {\n throw new Error(`'${key}' is a reserved property name on instances of classes extending Model. Please choose a different property name for your hasMany on ${this.constructor.toString()}`);\n }\n }\n const support = lookupLegacySupport(this);\n const manyArray = support.getManyArray(key);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You must pass an array of records to set a hasMany relationship`);\n }\n })(Array.isArray(records)) : {};\n this[RecordStore]._join(() => {\n manyArray.splice(0, manyArray.length, ...records);\n });\n return support.getHasMany(key);\n }\n }).meta(meta);\n}\n\n/**\n `hasMany` is used to define Many-To-One and Many-To-Many, and Many-To-None\n relationships on a [Model](/ember-data/release/classes/Model).\n\n `hasMany` takes a configuration hash as a second parameter, currently\n supported options are:\n\n - `async`: (*required*) A boolean value used to declare whether this is a sync (false) or async (true) relationship.\n - `inverse`: (*required*) A string used to identify the inverse property on a related model, or `null`.\n - `polymorphic`: (*optional*) A boolean value to mark the relationship as polymorphic\n - `as`: (*optional*) A string used to declare the abstract type \"this\" record satisfies for polymorphism.\n\n ### Examples\n\n To declare a **many-to-one** (or one-to-many) relationship, use\n `belongsTo` in combination with `hasMany`:\n\n ```js\n // app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class Post extends Model {\n @hasMany('comment', { async: false, inverse: 'post' }) comments;\n }\n\n\n // app/models/comment.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class Comment extends Model {\n @belongsTo('post', { async: false, inverse: 'comments' }) post;\n }\n ```\n\n To declare a **many-to-many** relationship with managed inverses, use `hasMany` for both sides:\n\n ```js\n // app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class Post extends Model {\n @hasMany('tag', { async: true, inverse: 'posts' }) tags;\n }\n\n // app/models/tag.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class Tag extends Model {\n @hasMany('post', { async: true, inverse: 'tags' }) posts;\n }\n ```\n\n To declare a **many-to-many** relationship without managed inverses, use `hasMany` for both sides\n with `null` as the inverse:\n\n ```js\n // app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class Post extends Model {\n @hasMany('tag', { async: true, inverse: null }) tags;\n }\n\n // app/models/tag.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class Tag extends Model {\n @hasMany('post', { async: true, inverse: null }) posts;\n }\n ```\n\n To declare a many-to-none relationship between two models, use\n `hasMany` with inverse set to `null` on just one side::\n\n ```js\n // app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class Post extends Model {\n @hasMany('category', { async: true, inverse: null }) categories;\n }\n ```\n\n #### Sync vs Async Relationships\n\n EmberData fulfills relationships using resource data available in\n the cache.\n\n Sync relationships point directly to the known related resources.\n\n When a relationship is declared as async, if any of the known related\n resources have not been loaded, they will be fetched. The property\n on the record when accessed provides a promise that resolves once\n all resources are loaded.\n\n Async relationships may take advantage of links. On access, if the related\n link has not been loaded, or if any known resources are not available in\n the cache, the fresh state will be fetched using the link.\n\n In contrast to async relationship, accessing a sync relationship\n will error on access when any of the known related resources have\n not been loaded.\n\n If you are using `links` with sync relationships, you have to use\n the HasMany reference API to fetch or refresh related resources\n that aren't loaded. For instance, for a `comments` relationship:\n\n ```js\n post.hasMany('comments').reload();\n ```\n\n #### Polymorphic Relationships\n\n To declare a polymorphic relationship, use `hasMany` with the `polymorphic`\n option set to `true`:\n\n ```js\n // app/models/comment.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class Comment extends Model {\n @belongsTo('commentable', { async: false, inverse: 'comments', polymorphic: true }) parent;\n }\n ```\n\n `'commentable'` here is referred to as the \"abstract type\" for the polymorphic\n relationship.\n\n Polymorphic relationships with `inverse: null` will accept any type of record as their content.\n Polymorphic relationships with `inverse` set to a string will only accept records with a matching\n inverse relationships declaring itself as satisfying the abstract type.\n\n Below, 'as' is used to declare the that 'post' record satisfies the abstract type 'commentable'\n for this relationship.\n\n ```js\n // app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class Post extends Model {\n @hasMany('comment', { async: false, inverse: 'parent', as: 'commentable' }) comments;\n }\n ```\n\n Note: every Model that declares an inverse to a polymorphic relationship must\n declare itself exactly the same. This is because polymorphism is based on structural\n traits.\n\n Polymorphic to polymorphic relationships are supported. Both sides of the relationship\n must be declared as polymorphic, and the `as` option must be used to declare the abstract\n type each record satisfies on both sides.\n\n @method hasMany\n @public\n @static\n @for @ember-data/model\n @param {string} type (optional) the name of the related resource\n @param {object} options (optional) a hash of options\n @return {PropertyDescriptor} relationship\n*/\n\n// export function hasMany, T extends Awaited = Awaited>(\n// type: TypeFromInstance>,\n// options: RelationshipOptions\n// ): RelationshipDecorator;\n\nfunction hasMany(type, options) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`hasMany must be invoked with a type and options. Did you mean \\`@hasMany(${type}, { async: false, inverse: null })\\`?`);\n }\n })(!isElementDescriptor(arguments)) : {};\n }\n return _hasMany(type, options);\n}\nexport { attr as a, belongsTo as b, hasMany as h };","import { deprecate } from '@ember/debug';\nimport { dasherize } from '@ember-data/request-utils/string';\nimport { macroCondition, getGlobalConfig, dependencySatisfies, importSync } from '@embroider/macros';\nimport EmberObject, { computed, get } from '@ember/object';\nimport { recordIdentifierFor as recordIdentifierFor$1, storeFor as storeFor$1 } from '@ember-data/store';\nimport { LiveArray, MUTATE, SOURCE, recordIdentifierFor, ARRAY_SIGNAL, notifyArray, isStableIdentifier, storeFor, peekCache, fastPush, coerceId } from '@ember-data/store/-private';\nimport { cached, compat } from '@ember-data/tracking';\nimport { addToTransaction, defineSignal, peekSignal, getSignal, subscribe } from '@ember-data/tracking/-private';\nimport { RecordStore } from '@warp-drive/core-types/symbols';\nimport { A } from '@ember/array';\nimport ArrayProxy from '@ember/array/proxy';\nimport { mapBy, not } from '@ember/object/computed';\nimport { upgradeStore } from '@ember-data/legacy-compat/-private';\nimport { getOrSetGlobal } from '@warp-drive/core-types/-private';\nimport PromiseProxyMixin from '@ember/object/promise-proxy-mixin';\nimport ObjectProxy from '@ember/object/proxy';\nimport { cacheFor } from '@ember/object/internals';\nfunction isElementDescriptor(args) {\n const [maybeTarget, maybeKey, maybeDesc] = args;\n return (\n // Ensure we have the right number of args\n args.length === 3 && (\n // Make sure the target is a class or object (prototype)\n typeof maybeTarget === 'function' || typeof maybeTarget === 'object' && maybeTarget !== null) &&\n // Make sure the key is a string\n typeof maybeKey === 'string' && (\n // Make sure the descriptor is the right shape\n typeof maybeDesc === 'object' && maybeDesc !== null && 'enumerable' in maybeDesc && 'configurable' in maybeDesc ||\n // TS compatibility\n maybeDesc === undefined)\n );\n}\nfunction normalizeModelName(type) {\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_NON_STRICT_TYPES)) {\n const result = dasherize(type);\n deprecate(`The resource type '${type}' is not normalized. Update your application code to use '${result}' instead of '${type}'.`, result === type, {\n id: 'ember-data:deprecate-non-strict-types',\n until: '6.0',\n for: 'ember-data',\n since: {\n available: '5.3',\n enabled: '5.3'\n }\n });\n return result;\n }\n return type;\n}\n\n/**\n @module @ember-data/store\n*/\n/**\n A `ManyArray` is a `MutableArray` that represents the contents of a has-many\n relationship.\n\n The `ManyArray` is instantiated lazily the first time the relationship is\n requested.\n\n This class is not intended to be directly instantiated by consuming applications.\n\n ### Inverses\n\n Often, the relationships in Ember Data applications will have\n an inverse. For example, imagine the following models are\n defined:\n\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n\n export default class PostModel extends Model {\n @hasMany('comment') comments;\n }\n ```\n\n ```app/models/comment.js\n import Model, { belongsTo } from '@ember-data/model';\n\n export default class CommentModel extends Model {\n @belongsTo('post') post;\n }\n ```\n\n If you created a new instance of `Post` and added\n a `Comment` record to its `comments` has-many\n relationship, you would expect the comment's `post`\n property to be set to the post that contained\n the has-many.\n\n We call the record to which a relationship belongs-to the\n relationship's _owner_.\n\n @class ManyArray\n @public\n*/\nclass RelatedCollection extends LiveArray {\n /**\n The loading state of this array\n @property {Boolean} isLoaded\n @public\n */\n\n /**\n `true` if the relationship is polymorphic, `false` otherwise.\n @property {Boolean} isPolymorphic\n @private\n */\n\n /**\n Metadata associated with the request for async hasMany relationships.\n Example\n Given that the server returns the following JSON payload when fetching a\n hasMany relationship:\n ```js\n {\n \"comments\": [{\n \"id\": 1,\n \"comment\": \"This is the first comment\",\n }, {\n // ...\n }],\n \"meta\": {\n \"page\": 1,\n \"total\": 5\n }\n }\n ```\n You can then access the meta data via the `meta` property:\n ```js\n let comments = await post.comments;\n let meta = comments.meta;\n // meta.page => 1\n // meta.total => 5\n ```\n @property {Object | null} meta\n @public\n */\n\n /**\n * Retrieve the links for this relationship\n *\n @property {Object | null} links\n @public\n */\n\n constructor(options) {\n super(options);\n this.isLoaded = options.isLoaded || false;\n this.isAsync = options.isAsync || false;\n this.isPolymorphic = options.isPolymorphic || false;\n this.identifier = options.identifier;\n this.key = options.key;\n }\n [MUTATE](target, receiver, prop, args, _SIGNAL) {\n switch (prop) {\n case 'length 0':\n {\n Reflect.set(target, 'length', 0);\n mutateReplaceRelatedRecords(this, [], _SIGNAL);\n return true;\n }\n case 'replace cell':\n {\n const [index, prior, value] = args;\n target[index] = value;\n mutateReplaceRelatedRecord(this, {\n value,\n prior,\n index\n }, _SIGNAL);\n return true;\n }\n case 'push':\n {\n const newValues = extractIdentifiersFromRecords(args);\n assertNoDuplicates(this, target, currentState => currentState.push(...newValues), `Cannot push duplicates to a hasMany's state.`);\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_MANY_ARRAY_DUPLICATES)) {\n // dedupe\n const seen = new Set(target);\n const unique = new Set();\n args.forEach(item => {\n const identifier = recordIdentifierFor(item);\n if (!seen.has(identifier)) {\n seen.add(identifier);\n unique.add(item);\n }\n });\n const newArgs = Array.from(unique);\n const result = Reflect.apply(target[prop], receiver, newArgs);\n if (newArgs.length) {\n mutateAddToRelatedRecords(this, {\n value: extractIdentifiersFromRecords(newArgs)\n }, _SIGNAL);\n }\n return result;\n }\n\n // else, no dedupe, error on duplicates\n const result = Reflect.apply(target[prop], receiver, args);\n if (newValues.length) {\n mutateAddToRelatedRecords(this, {\n value: newValues\n }, _SIGNAL);\n }\n return result;\n }\n case 'pop':\n {\n const result = Reflect.apply(target[prop], receiver, args);\n if (result) {\n mutateRemoveFromRelatedRecords(this, {\n value: recordIdentifierFor(result)\n }, _SIGNAL);\n }\n return result;\n }\n case 'unshift':\n {\n const newValues = extractIdentifiersFromRecords(args);\n assertNoDuplicates(this, target, currentState => currentState.unshift(...newValues), `Cannot unshift duplicates to a hasMany's state.`);\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_MANY_ARRAY_DUPLICATES)) {\n // dedupe\n const seen = new Set(target);\n const unique = new Set();\n args.forEach(item => {\n const identifier = recordIdentifierFor(item);\n if (!seen.has(identifier)) {\n seen.add(identifier);\n unique.add(item);\n }\n });\n const newArgs = Array.from(unique);\n const result = Reflect.apply(target[prop], receiver, newArgs);\n if (newArgs.length) {\n mutateAddToRelatedRecords(this, {\n value: extractIdentifiersFromRecords(newArgs),\n index: 0\n }, _SIGNAL);\n }\n return result;\n }\n\n // else, no dedupe, error on duplicates\n const result = Reflect.apply(target[prop], receiver, args);\n if (newValues.length) {\n mutateAddToRelatedRecords(this, {\n value: newValues,\n index: 0\n }, _SIGNAL);\n }\n return result;\n }\n case 'shift':\n {\n const result = Reflect.apply(target[prop], receiver, args);\n if (result) {\n mutateRemoveFromRelatedRecords(this, {\n value: recordIdentifierFor(result),\n index: 0\n }, _SIGNAL);\n }\n return result;\n }\n case 'sort':\n {\n const result = Reflect.apply(target[prop], receiver, args);\n mutateSortRelatedRecords(this, result.map(recordIdentifierFor), _SIGNAL);\n return result;\n }\n case 'splice':\n {\n const [start, deleteCount, ...adds] = args;\n\n // detect a full replace\n if (start === 0 && deleteCount === this[SOURCE].length) {\n const newValues = extractIdentifiersFromRecords(adds);\n assertNoDuplicates(this, target, currentState => currentState.splice(start, deleteCount, ...newValues), `Cannot replace a hasMany's state with a new state that contains duplicates.`);\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_MANY_ARRAY_DUPLICATES)) {\n // dedupe\n const current = new Set(adds);\n const unique = Array.from(current);\n const newArgs = [start, deleteCount].concat(unique);\n const result = Reflect.apply(target[prop], receiver, newArgs);\n mutateReplaceRelatedRecords(this, extractIdentifiersFromRecords(unique), _SIGNAL);\n return result;\n }\n\n // else, no dedupe, error on duplicates\n const result = Reflect.apply(target[prop], receiver, args);\n mutateReplaceRelatedRecords(this, newValues, _SIGNAL);\n return result;\n }\n const newValues = extractIdentifiersFromRecords(adds);\n assertNoDuplicates(this, target, currentState => currentState.splice(start, deleteCount, ...newValues), `Cannot splice a hasMany's state with a new state that contains duplicates.`);\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_MANY_ARRAY_DUPLICATES)) {\n // dedupe\n const currentState = target.slice();\n currentState.splice(start, deleteCount);\n const seen = new Set(currentState);\n const unique = [];\n adds.forEach(item => {\n const identifier = recordIdentifierFor(item);\n if (!seen.has(identifier)) {\n seen.add(identifier);\n unique.push(item);\n }\n });\n const newArgs = [start, deleteCount, ...unique];\n const result = Reflect.apply(target[prop], receiver, newArgs);\n if (deleteCount > 0) {\n mutateRemoveFromRelatedRecords(this, {\n value: result.map(recordIdentifierFor),\n index: start\n }, _SIGNAL);\n }\n if (unique.length > 0) {\n mutateAddToRelatedRecords(this, {\n value: extractIdentifiersFromRecords(unique),\n index: start\n }, _SIGNAL);\n }\n return result;\n }\n\n // else, no dedupe, error on duplicates\n const result = Reflect.apply(target[prop], receiver, args);\n if (deleteCount > 0) {\n mutateRemoveFromRelatedRecords(this, {\n value: result.map(recordIdentifierFor),\n index: start\n }, _SIGNAL);\n }\n if (newValues.length > 0) {\n mutateAddToRelatedRecords(this, {\n value: newValues,\n index: start\n }, _SIGNAL);\n }\n return result;\n }\n default:\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`unable to convert ${prop} into a transaction that updates the cache state for this record array`);\n }\n })() : {};\n }\n }\n notify() {\n const signal = this[ARRAY_SIGNAL];\n signal.shouldReset = true;\n notifyArray(this);\n }\n\n /**\n Reloads all of the records in the manyArray. If the manyArray\n holds a relationship that was originally fetched using a links url\n EmberData will revisit the original links url to repopulate the\n relationship.\n If the ManyArray holds the result of a `store.query()` reload will\n re-run the original query.\n Example\n ```javascript\n let user = store.peekRecord('user', '1')\n await login(user);\n let permissions = await user.permissions;\n await permissions.reload();\n ```\n @method reload\n @public\n */\n reload(options) {\n // TODO this is odd, we don't ask the store for anything else like this?\n return this._manager.reloadHasMany(this.key, options);\n }\n\n /**\n Saves all of the records in the `ManyArray`.\n Example\n ```javascript\n let inbox = await store.findRecord('inbox', '1');\n let messages = await inbox.messages;\n messages.forEach((message) => {\n message.isRead = true;\n });\n messages.save();\n ```\n @method save\n @public\n @return {PromiseArray} promise\n */\n\n /**\n Create a child record within the owner\n @method createRecord\n @public\n @param {Object} hash\n @return {Model} record\n */\n createRecord(hash) {\n const {\n store\n } = this;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected modelName to be set`);\n }\n })(this.modelName) : {};\n const record = store.createRecord(this.modelName, hash);\n this.push(record);\n return record;\n }\n destroy() {\n super.destroy(false);\n }\n}\nRelatedCollection.prototype.isAsync = false;\nRelatedCollection.prototype.isPolymorphic = false;\nRelatedCollection.prototype.identifier = null;\nRelatedCollection.prototype.cache = null;\nRelatedCollection.prototype._inverseIsAsync = false;\nRelatedCollection.prototype.key = '';\nRelatedCollection.prototype.DEPRECATED_CLASS_NAME = 'ManyArray';\nfunction assertRecordPassedToHasMany(record) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`All elements of a hasMany relationship must be instances of Model, you passed $${typeof record}`);\n }\n })(function () {\n try {\n recordIdentifierFor(record);\n return true;\n } catch {\n return false;\n }\n }()) : {};\n}\nfunction extractIdentifiersFromRecords(records) {\n return records.map(extractIdentifierFromRecord$1);\n}\nfunction extractIdentifierFromRecord$1(recordOrPromiseRecord) {\n assertRecordPassedToHasMany(recordOrPromiseRecord);\n return recordIdentifierFor(recordOrPromiseRecord);\n}\nfunction assertNoDuplicates(collection, target, callback, reason) {\n const state = target.slice();\n callback(state);\n if (state.length !== new Set(state).size) {\n const duplicates = state.filter((currentValue, currentIndex) => state.indexOf(currentValue) !== currentIndex);\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_MANY_ARRAY_DUPLICATES)) {\n deprecate(`${reason} This behavior is deprecated. Found duplicates for the following records within the new state provided to \\`<${collection.identifier.type}:${collection.identifier.id || collection.identifier.lid}>.${collection.key}\\`\\n\\t- ${Array.from(new Set(duplicates)).map(r => isStableIdentifier(r) ? r.lid : recordIdentifierFor(r).lid).sort((a, b) => a.localeCompare(b)).join('\\n\\t- ')}`, false, {\n id: 'ember-data:deprecate-many-array-duplicates',\n for: 'ember-data',\n until: '6.0',\n since: {\n enabled: '5.3',\n available: '5.3'\n }\n });\n } else {\n throw new Error(`${reason} Found duplicates for the following records within the new state provided to \\`<${collection.identifier.type}:${collection.identifier.id || collection.identifier.lid}>.${collection.key}\\`\\n\\t- ${Array.from(new Set(duplicates)).map(r => isStableIdentifier(r) ? r.lid : recordIdentifierFor(r).lid).sort((a, b) => a.localeCompare(b)).join('\\n\\t- ')}`);\n }\n }\n}\nfunction mutateAddToRelatedRecords(collection, operationInfo, _SIGNAL) {\n mutate(collection, {\n op: 'addToRelatedRecords',\n record: collection.identifier,\n field: collection.key,\n ...operationInfo\n }, _SIGNAL);\n}\nfunction mutateRemoveFromRelatedRecords(collection, operationInfo, _SIGNAL) {\n mutate(collection, {\n op: 'removeFromRelatedRecords',\n record: collection.identifier,\n field: collection.key,\n ...operationInfo\n }, _SIGNAL);\n}\nfunction mutateReplaceRelatedRecord(collection, operationInfo, _SIGNAL) {\n mutate(collection, {\n op: 'replaceRelatedRecord',\n record: collection.identifier,\n field: collection.key,\n ...operationInfo\n }, _SIGNAL);\n}\nfunction mutateReplaceRelatedRecords(collection, value, _SIGNAL) {\n mutate(collection, {\n op: 'replaceRelatedRecords',\n record: collection.identifier,\n field: collection.key,\n value\n }, _SIGNAL);\n}\nfunction mutateSortRelatedRecords(collection, value, _SIGNAL) {\n mutate(collection, {\n op: 'sortRelatedRecords',\n record: collection.identifier,\n field: collection.key,\n value\n }, _SIGNAL);\n}\nfunction mutate(collection, mutation, _SIGNAL) {\n collection._manager.mutate(mutation);\n addToTransaction(_SIGNAL);\n}\nconst PromiseObject = ObjectProxy.extend(PromiseProxyMixin);\nvar __defProp = Object.defineProperty;\nvar __export = (target, all) => {\n for (var name in all) __defProp(target, name, {\n get: all[name],\n enumerable: true\n });\n};\n\n// src/runtime.ts\nvar runtime_exports = {};\n__export(runtime_exports, {\n c: () => decorateClass,\n f: () => decorateFieldV1,\n g: () => decorateFieldV2,\n i: () => initializeDeferredDecorator,\n m: () => decorateMethodV1,\n n: () => decorateMethodV2,\n p: () => decoratePOJO\n});\nvar deferred = /* @__PURE__ */new WeakMap();\nfunction deferDecorator(proto, prop, desc) {\n let map = deferred.get(proto);\n if (!map) {\n map = /* @__PURE__ */new Map();\n deferred.set(proto, map);\n }\n map.set(prop, desc);\n}\nfunction findDeferredDecorator(target, prop) {\n let cursor = target.prototype;\n while (cursor) {\n let desc = deferred.get(cursor)?.get(prop);\n if (desc) {\n return desc;\n }\n cursor = cursor.prototype;\n }\n}\nfunction decorateFieldV1(target, prop, decorators, initializer) {\n return decorateFieldV2(target.prototype, prop, decorators, initializer);\n}\nfunction decorateFieldV2(prototype, prop, decorators, initializer) {\n let desc = {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: null\n };\n if (initializer) {\n desc.initializer = initializer;\n }\n for (let decorator of decorators) {\n desc = decorator(prototype, prop, desc) || desc;\n }\n if (desc.initializer === void 0) {\n Object.defineProperty(prototype, prop, desc);\n } else {\n deferDecorator(prototype, prop, desc);\n }\n}\nfunction decorateMethodV1({\n prototype\n}, prop, decorators) {\n return decorateMethodV2(prototype, prop, decorators);\n}\nfunction decorateMethodV2(prototype, prop, decorators) {\n const origDesc = Object.getOwnPropertyDescriptor(prototype, prop);\n let desc = {\n ...origDesc\n };\n for (let decorator of decorators) {\n desc = decorator(prototype, prop, desc) || desc;\n }\n if (desc.initializer !== void 0) {\n desc.value = desc.initializer ? desc.initializer.call(prototype) : void 0;\n desc.initializer = void 0;\n }\n Object.defineProperty(prototype, prop, desc);\n}\nfunction initializeDeferredDecorator(target, prop) {\n let desc = findDeferredDecorator(target.constructor, prop);\n if (desc) {\n Object.defineProperty(target, prop, {\n enumerable: desc.enumerable,\n configurable: desc.configurable,\n writable: desc.writable,\n value: desc.initializer ? desc.initializer.call(target) : void 0\n });\n }\n}\nfunction decorateClass(target, decorators) {\n return decorators.reduce((accum, decorator) => decorator(accum) || accum, target);\n}\nfunction decoratePOJO(pojo, decorated) {\n for (let [type, prop, decorators] of decorated) {\n if (type === \"field\") {\n decoratePojoField(pojo, prop, decorators);\n } else {\n decorateMethodV2(pojo, prop, decorators);\n }\n }\n return pojo;\n}\nfunction decoratePojoField(pojo, prop, decorators) {\n let desc = {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: () => Object.getOwnPropertyDescriptor(pojo, prop)?.value\n };\n for (let decorator of decorators) {\n desc = decorator(pojo, prop, desc) || desc;\n }\n if (desc.initializer) {\n desc.value = desc.initializer.call(pojo);\n delete desc.initializer;\n }\n Object.defineProperty(pojo, prop, desc);\n}\nconst LegacyPromiseProxy = Symbol.for('LegacyPromiseProxy');\n\n// eslint-disable-next-line @typescript-eslint/no-unused-vars, @typescript-eslint/no-extraneous-class\n\nconst Extended = PromiseObject;\n\n/**\n @module @ember-data/model\n */\n\n/**\n A PromiseBelongsTo is a PromiseObject that also proxies certain method calls\n to the underlying belongsTo model.\n Right now we proxy:\n * `reload()`\n @class PromiseBelongsTo\n @extends PromiseObject\n @private\n*/\nclass PromiseBelongsTo extends Extended {\n get id() {\n const {\n key,\n legacySupport\n } = this._belongsToState;\n const ref = legacySupport.referenceFor('belongsTo', key);\n return ref.id();\n }\n\n // we don't proxy meta because we would need to proxy it to the relationship state container\n // however, meta on relationships does not trigger change notifications.\n // if you need relationship meta, you should do `record.belongsTo(relationshipName).meta()`\n static {\n decorateMethodV2(this.prototype, \"id\", [cached]);\n }\n get meta() {\n // eslint-disable-next-line no-constant-condition\n {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error('You attempted to access meta on the promise for the async belongsTo relationship ' + `${this._belongsToState.modelName}:${this._belongsToState.key}'.` + '\\nUse `record.belongsTo(relationshipName).meta()` instead.');\n }\n })() : {};\n }\n return;\n }\n static {\n decorateMethodV2(this.prototype, \"meta\", [computed()]);\n }\n async reload(options) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('You are trying to reload an async belongsTo before it has been created');\n }\n })(this.content !== undefined) : {};\n const {\n key,\n legacySupport\n } = this._belongsToState;\n await legacySupport.reloadBelongsTo(key, options);\n return this;\n }\n [LegacyPromiseProxy] = true;\n}\n\n/**\n @module @ember-data/model\n */\n/**\n This class is returned as the result of accessing an async hasMany relationship\n on an instance of a Model extending from `@ember-data/model`.\n\n A PromiseManyArray is an iterable proxy that allows templates to consume related\n ManyArrays and update once their contents are no longer pending.\n\n In your JS code you should resolve the promise first.\n\n ```js\n const comments = await post.comments;\n ```\n\n @class PromiseManyArray\n @public\n*/\nclass PromiseManyArray {\n constructor(promise, content) {\n this._update(promise, content);\n this.isDestroyed = false;\n }\n\n /**\n * Retrieve the length of the content\n * @property length\n * @public\n */\n get length() {\n // shouldn't be needed, but ends up being needed\n // for computed chains even in 4.x\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_COMPUTED_CHAINS)) {\n this['[]'];\n }\n return this.content ? this.content.length : 0;\n }\n\n /**\n * Iterate the proxied content. Called by the glimmer iterator in #each\n * We do not guarantee that forEach will always be available. This\n * may eventually be made to use Symbol.Iterator once glimmer supports it.\n *\n * @method forEach\n * @param cb\n * @return\n * @private\n */\n static {\n decorateMethodV2(this.prototype, \"length\", [compat]);\n }\n forEach(cb) {\n if (this.content && this.length) {\n this.content.forEach(cb);\n }\n }\n\n /**\n * Reload the relationship\n * @method reload\n * @public\n * @param options\n * @return\n */\n reload(options) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('You are trying to reload an async manyArray before it has been created');\n }\n })(this.content) : {};\n void this.content.reload(options);\n return this;\n }\n\n //---- Properties/Methods from the PromiseProxyMixin that we will keep as our API\n\n /**\n * Whether the loading promise is still pending\n *\n * @property {boolean} isPending\n * @public\n */\n\n /**\n * Whether the loading promise rejected\n *\n * @property {boolean} isRejected\n * @public\n */\n\n /**\n * Whether the loading promise succeeded\n *\n * @property {boolean} isFulfilled\n * @public\n */\n\n /**\n * Whether the loading promise completed (resolved or rejected)\n *\n * @property {boolean} isSettled\n * @public\n */\n\n /**\n * chain this promise\n *\n * @method then\n * @public\n * @param success\n * @param fail\n * @return Promise\n */\n then(s, f) {\n return this.promise.then(s, f);\n }\n\n /**\n * catch errors thrown by this promise\n * @method catch\n * @public\n * @param callback\n * @return Promise\n */\n catch(cb) {\n return this.promise.catch(cb);\n }\n\n /**\n * run cleanup after this promise completes\n *\n * @method finally\n * @public\n * @param callback\n * @return Promise\n */\n finally(cb) {\n return this.promise.finally(cb);\n }\n\n //---- Methods on EmberObject that we should keep\n\n destroy() {\n this.isDestroyed = true;\n this.content = null;\n this.promise = null;\n }\n\n //---- Methods/Properties on ManyArray that we own and proxy to\n\n /**\n * Retrieve the links for this relationship\n * @property links\n * @public\n */\n get links() {\n return this.content ? this.content.links : undefined;\n }\n\n /**\n * Retrieve the meta for this relationship\n * @property meta\n * @public\n */\n static {\n decorateMethodV2(this.prototype, \"links\", [compat]);\n }\n get meta() {\n return this.content ? this.content.meta : undefined;\n }\n\n //---- Our own stuff\n static {\n decorateMethodV2(this.prototype, \"meta\", [compat]);\n }\n _update(promise, content) {\n if (content !== undefined) {\n this.content = content;\n }\n this.promise = tapPromise(this, promise);\n }\n static create({\n promise,\n content\n }) {\n return new this(promise, content);\n }\n [LegacyPromiseProxy] = true;\n}\ndefineSignal(PromiseManyArray.prototype, 'content', null);\ndefineSignal(PromiseManyArray.prototype, 'isPending', false);\ndefineSignal(PromiseManyArray.prototype, 'isRejected', false);\ndefineSignal(PromiseManyArray.prototype, 'isFulfilled', false);\ndefineSignal(PromiseManyArray.prototype, 'isSettled', false);\n\n// this will error if someone tries to call\n// A(identifierArray) since it is not configurable\n// which is preferrable to the `meta` override we used\n// before which required importing all of Ember\nif (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_COMPUTED_CHAINS)) {\n const desc = {\n enumerable: true,\n configurable: false,\n get: function () {\n return this.content?.length && this.content;\n }\n };\n compat(desc);\n\n // ember-source < 3.23 (e.g. 3.20 lts)\n // requires that the tag `'[]'` be notified\n // on the ArrayProxy in order for `{{#each}}`\n // to recompute. We entangle the '[]' tag from content\n // eslint-disable-next-line @typescript-eslint/no-floating-promises\n Object.defineProperty(PromiseManyArray.prototype, '[]', desc);\n}\nfunction tapPromise(proxy, promise) {\n proxy.isPending = true;\n proxy.isSettled = false;\n proxy.isFulfilled = false;\n proxy.isRejected = false;\n return Promise.resolve(promise).then(content => {\n proxy.isPending = false;\n proxy.isFulfilled = true;\n proxy.isSettled = true;\n proxy.content = content;\n return content;\n }, error => {\n proxy.isPending = false;\n proxy.isFulfilled = false;\n proxy.isRejected = true;\n proxy.isSettled = true;\n throw error;\n });\n}\n\n/*\n Assert that `addedRecord` has a valid type so it can be added to the\n relationship of the `record`.\n\n The assert basically checks if the `addedRecord` can be added to the\n relationship (specified via `relationshipMeta`) of the `record`.\n\n This utility should only be used internally, as both record parameters must\n be stable record identifiers and the `relationshipMeta` needs to be the meta\n information about the relationship, retrieved via\n `record.relationshipFor(key)`.\n*/\nlet assertPolymorphicType;\nif (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n // eslint-disable-next-line @typescript-eslint/no-shadow\n assertPolymorphicType = function assertPolymorphicType(parentIdentifier, parentDefinition, addedIdentifier, store) {\n if (parentDefinition.inverseIsImplicit) {\n return;\n }\n if (parentDefinition.isPolymorphic) {\n const meta = store.schema.fields(addedIdentifier)?.get(parentDefinition.inverseKey);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected the schema for the field ${parentDefinition.inverseKey} on ${addedIdentifier.type} to be for a legacy relationship`);\n }\n })(!meta || meta.kind === 'belongsTo' || meta.kind === 'hasMany') : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`The schema for the relationship '${parentDefinition.inverseKey}' on '${addedIdentifier.type}' type does not implement '${parentDefinition.type}' and thus cannot be assigned to the '${parentDefinition.key}' relationship in '${parentIdentifier.type}'. The definition should specify 'as: \"${parentDefinition.type}\"' in options.`);\n }\n })(meta?.options.as === parentDefinition.type) : {};\n }\n };\n}\nfunction isResourceIdentiferWithRelatedLinks$1(value) {\n return Boolean(value && value.links && value.links.related);\n}\n/**\n A `HasManyReference` is a low-level API that allows access\n and manipulation of a hasMany relationship.\n\n It is especially useful when you're dealing with `async` relationships\n from `@ember-data/model` as it allows synchronous access to\n the relationship data if loaded, as well as APIs for loading, reloading\n the data or accessing available information without triggering a load.\n\n It may also be useful when using `sync` relationships with `@ember-data/model`\n that need to be loaded/reloaded with more precise timing than marking the\n relationship as `async` and relying on autofetch would have allowed.\n\n However,keep in mind that marking a relationship as `async: false` will introduce\n bugs into your application if the data is not always guaranteed to be available\n by the time the relationship is accessed. Ergo, it is recommended when using this\n approach to utilize `links` for unloaded relationship state instead of identifiers.\n\n Reference APIs are entangled with the relationship's underlying state,\n thus any getters or cached properties that utilize these will properly\n invalidate if the relationship state changes.\n\n References are \"stable\", meaning that multiple calls to retrieve the reference\n for a given relationship will always return the same HasManyReference.\n\n @class HasManyReference\n @public\n */\nclass HasManyReference {\n /**\n * The field name on the parent record for this has-many relationship.\n *\n * @property {String} key\n * @public\n */\n\n /**\n * The type of resource this relationship will contain.\n *\n * @property {String} type\n * @public\n */\n\n // unsubscribe tokens given to us by the notification manager\n ___token;\n ___identifier;\n ___relatedTokenMap;\n constructor(store, graph, parentIdentifier, hasManyRelationship, key) {\n this.graph = graph;\n this.key = key;\n this.hasManyRelationship = hasManyRelationship;\n this.type = hasManyRelationship.definition.type;\n this.store = store;\n this.___identifier = parentIdentifier;\n this.___token = store.notifications.subscribe(parentIdentifier, (_, bucket, notifiedKey) => {\n if (bucket === 'relationships' && notifiedKey === key) {\n this._ref++;\n }\n });\n this.___relatedTokenMap = new Map();\n // TODO inverse\n }\n\n /**\n * This method should never be called by user code.\n *\n * @internal\n */\n destroy() {\n this.store.notifications.unsubscribe(this.___token);\n this.___relatedTokenMap.forEach(token => {\n this.store.notifications.unsubscribe(token);\n });\n this.___relatedTokenMap.clear();\n }\n\n /**\n * An array of identifiers for the records that this reference refers to.\n *\n * @property {StableRecordIdentifier[]} identifiers\n * @public\n */\n get identifiers() {\n this._ref; // consume the tracked prop\n\n const resource = this._resource();\n const map = this.___relatedTokenMap;\n this.___relatedTokenMap = new Map();\n if (resource && resource.data) {\n return resource.data.map(resourceIdentifier => {\n const identifier = this.store.identifierCache.getOrCreateRecordIdentifier(resourceIdentifier);\n let token = map.get(identifier);\n if (token) {\n map.delete(identifier);\n } else {\n token = this.store.notifications.subscribe(identifier, (_, bucket, notifiedKey) => {\n if (bucket === 'identity' || bucket === 'attributes' && notifiedKey === 'id') {\n this._ref++;\n }\n });\n }\n this.___relatedTokenMap.set(identifier, token);\n return identifier;\n });\n }\n map.forEach(token => {\n this.store.notifications.unsubscribe(token);\n });\n map.clear();\n return [];\n }\n static {\n decorateMethodV2(this.prototype, \"identifiers\", [compat, cached]);\n }\n _resource() {\n const cache = this.store.cache;\n return cache.getRelationship(this.___identifier, this.key);\n }\n\n /**\n This returns a string that represents how the reference will be\n looked up when it is loaded. If the relationship has a link it will\n use the \"link\" otherwise it defaults to \"id\".\n Example\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class PostModel extends Model {\n @hasMany('comment', { async: true, inverse: null }) comments;\n }\n ```\n ```javascript\n let post = store.push({\n data: {\n type: 'post',\n id: 1,\n relationships: {\n comments: {\n data: [{ type: 'comment', id: 1 }]\n }\n }\n }\n });\n let commentsRef = post.hasMany('comments');\n // get the identifier of the reference\n if (commentsRef.remoteType() === \"ids\") {\n let ids = commentsRef.ids();\n } else if (commentsRef.remoteType() === \"link\") {\n let link = commentsRef.link();\n }\n ```\n @method remoteType\n @public\n @return {String} The name of the remote type. This should either be `link` or `ids`\n */\n remoteType() {\n const value = this._resource();\n if (value && value.links && value.links.related) {\n return 'link';\n }\n return 'ids';\n }\n\n /**\n `ids()` returns an array of the record IDs in this relationship.\n Example\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class PostModel extends Model {\n @hasMany('comment', { async: true, inverse: null }) comments;\n }\n ```\n ```javascript\n let post = store.push({\n data: {\n type: 'post',\n id: 1,\n relationships: {\n comments: {\n data: [{ type: 'comment', id: 1 }]\n }\n }\n }\n });\n let commentsRef = post.hasMany('comments');\n commentsRef.ids(); // ['1']\n ```\n @method ids\n @public\n @return {Array} The ids in this has-many relationship\n */\n ids() {\n return this.identifiers.map(identifier => identifier.id);\n }\n\n /**\n The link Ember Data will use to fetch or reload this belongs-to\n relationship. By default it uses only the \"related\" resource linkage.\n Example\n ```javascript\n // models/blog.js\n import Model, { belongsTo } from '@ember-data/model';\n export default Model.extend({\n user: belongsTo('user', { async: true, inverse: null })\n });\n let blog = store.push({\n data: {\n type: 'blog',\n id: 1,\n relationships: {\n user: {\n links: {\n related: '/articles/1/author'\n }\n }\n }\n }\n });\n let userRef = blog.belongsTo('user');\n // get the identifier of the reference\n if (userRef.remoteType() === \"link\") {\n let link = userRef.link();\n }\n ```\n @method link\n @public\n @return {String} The link Ember Data will use to fetch or reload this belongs-to relationship.\n */\n link() {\n const resource = this._resource();\n if (isResourceIdentiferWithRelatedLinks$1(resource)) {\n if (resource.links) {\n const related = resource.links.related;\n return !related || typeof related === 'string' ? related : related.href;\n }\n }\n return null;\n }\n\n /**\n * any links that have been received for this relationship\n *\n * @method links\n * @public\n * @return\n */\n links() {\n const resource = this._resource();\n return resource && resource.links ? resource.links : null;\n }\n\n /**\n The meta data for the has-many relationship.\n Example\n ```javascript\n // models/blog.js\n import Model, { hasMany } from '@ember-data/model';\n export default Model.extend({\n users: hasMany('user', { async: true, inverse: null })\n });\n let blog = store.push({\n data: {\n type: 'blog',\n id: 1,\n relationships: {\n users: {\n links: {\n related: {\n href: '/articles/1/authors'\n },\n },\n meta: {\n lastUpdated: 1458014400000\n }\n }\n }\n }\n });\n let usersRef = blog.hasMany('user');\n usersRef.meta() // { lastUpdated: 1458014400000 }\n ```\n @method meta\n @public\n @return {Object|null} The meta information for the belongs-to relationship.\n */\n meta() {\n let meta = null;\n const resource = this._resource();\n if (resource && resource.meta && typeof resource.meta === 'object') {\n meta = resource.meta;\n }\n return meta;\n }\n\n /**\n `push` can be used to update the data in the relationship and EmberData\n will treat the new data as the canonical value of this relationship on\n the backend. An empty array will signify the canonical value should be\n empty.\n Example model\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class PostModel extends Model {\n @hasMany('comment', { async: true, inverse: null }) comments;\n }\n ```\n Setup some initial state, note we haven't loaded the comments yet:\n ```js\n const post = store.push({\n data: {\n type: 'post',\n id: '1',\n relationships: {\n comments: {\n data: [{ type: 'comment', id: '1' }]\n }\n }\n }\n });\n const commentsRef = post.hasMany('comments');\n commentsRef.ids(); // ['1']\n ```\n Update the state using `push`, note we can do this even without\n having loaded these comments yet by providing resource identifiers.\n Both full resources and resource identifiers are supported.\n ```js\n await commentsRef.push({\n data: [\n { type: 'comment', id: '2' },\n { type: 'comment', id: '3' },\n ]\n });\n commentsRef.ids(); // ['2', '3']\n ```\n For convenience, you can also pass in an array of resources or resource identifiers\n without wrapping them in the `data` property:\n ```js\n await commentsRef.push([\n { type: 'comment', id: '4' },\n { type: 'comment', id: '5' },\n ]);\n commentsRef.ids(); // ['4', '5']\n ```\n When using the `data` property, you may also include other resource data via included,\n as well as provide new links and meta to the relationship.\n ```js\n await commentsRef.push({\n links: {\n related: '/posts/1/comments'\n },\n meta: {\n total: 2\n },\n data: [\n { type: 'comment', id: '4' },\n { type: 'comment', id: '5' },\n ],\n included: [\n { type: 'other-thing', id: '1', attributes: { foo: 'bar' },\n ]\n });\n ```\n By default, the store will attempt to fetch any unloaded records before resolving\n the returned promise with the ManyArray.\n Alternatively, pass `true` as the second argument to avoid fetching unloaded records\n and instead the promise will resolve with void without attempting to fetch. This is\n particularly useful if you want to update the state of the relationship without\n forcing the load of all of the associated records.\n @method push\n @public\n @param {Array|Object} doc a JSONAPI document object describing the new value of this relationship.\n @param {Boolean} [skipFetch] if `true`, do not attempt to fetch unloaded records\n @return {Promise}\n */\n async push(doc, skipFetch) {\n const {\n store\n } = this;\n const dataDoc = Array.isArray(doc) ? {\n data: doc\n } : doc;\n const isResourceData = Array.isArray(dataDoc.data) && dataDoc.data.length > 0 && isMaybeResource(dataDoc.data[0]);\n\n // enforce that one of links, meta or data is present\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You must provide at least one of 'links', 'meta' or 'data' when calling hasManyReference.push`);\n }\n })('links' in dataDoc || 'meta' in dataDoc || 'data' in dataDoc) : {};\n const identifiers = !Array.isArray(dataDoc.data) ? [] : isResourceData ? store._push(dataDoc, true) : dataDoc.data.map(i => store.identifierCache.getOrCreateRecordIdentifier(i));\n const {\n identifier\n } = this.hasManyRelationship;\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n const relationshipMeta = this.hasManyRelationship.definition;\n identifiers.forEach(added => {\n assertPolymorphicType(identifier, relationshipMeta, added, store);\n });\n }\n const newData = {};\n // only set data if it was passed in\n if (Array.isArray(dataDoc.data)) {\n newData.data = identifiers;\n }\n if ('links' in dataDoc) {\n newData.links = dataDoc.links;\n }\n if ('meta' in dataDoc) {\n newData.meta = dataDoc.meta;\n }\n store._join(() => {\n this.graph.push({\n op: 'updateRelationship',\n record: identifier,\n field: this.key,\n value: newData\n });\n });\n if (!skipFetch) return this.load();\n }\n _isLoaded() {\n const hasRelationshipDataProperty = this.hasManyRelationship.state.hasReceivedData;\n if (!hasRelationshipDataProperty) {\n return false;\n }\n const relationship = this.graph.getData(this.hasManyRelationship.identifier, this.key);\n return relationship.data?.every(identifier => {\n return this.store._instanceCache.recordIsLoaded(identifier, true) === true;\n });\n }\n\n /**\n `value()` synchronously returns the current value of the has-many\n relationship. Unlike `record.relationshipName`, calling\n `value()` on a reference does not trigger a fetch if the async\n relationship is not yet loaded. If the relationship is not loaded\n it will always return `null`.\n Example\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class PostModel extends Model {\n @hasMany('comment', { async: true, inverse: null }) comments;\n }\n ```\n ```javascript\n let post = store.push({\n data: {\n type: 'post',\n id: 1,\n relationships: {\n comments: {\n data: [{ type: 'comment', id: 1 }]\n }\n }\n }\n });\n let commentsRef = post.hasMany('comments');\n post.comments.then(function(comments) {\n commentsRef.value() === comments\n })\n ```\n @method value\n @public\n @return {ManyArray}\n */\n value() {\n const support = LEGACY_SUPPORT.get(this.___identifier);\n const loaded = this._isLoaded();\n if (!loaded) {\n // subscribe to changes\n // for when we are not loaded yet\n this._ref;\n return null;\n }\n return support.getManyArray(this.key);\n }\n\n /**\n Loads the relationship if it is not already loaded. If the\n relationship is already loaded this method does not trigger a new\n load. This causes a request to the specified\n relationship link or reloads all items currently in the relationship.\n Example\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class PostModel extends Model {\n @hasMany('comment', { async: true, inverse: null }) comments;\n }\n ```\n ```javascript\n let post = store.push({\n data: {\n type: 'post',\n id: 1,\n relationships: {\n comments: {\n data: [{ type: 'comment', id: 1 }]\n }\n }\n }\n });\n let commentsRef = post.hasMany('comments');\n commentsRef.load().then(function(comments) {\n //...\n });\n ```\n You may also pass in an options object whose properties will be\n fed forward. This enables you to pass `adapterOptions` into the\n request given to the adapter via the reference.\n Example\n ```javascript\n commentsRef.load({ adapterOptions: { isPrivate: true } })\n .then(function(comments) {\n //...\n });\n ```\n ```app/adapters/comment.js\n export default ApplicationAdapter.extend({\n findMany(store, type, id, snapshots) {\n // In the adapter you will have access to adapterOptions.\n let adapterOptions = snapshots[0].adapterOptions;\n }\n });\n ```\n @method load\n @public\n @param {Object} options the options to pass in.\n @return {Promise} a promise that resolves with the ManyArray in\n this has-many relationship.\n */\n async load(options) {\n const support = LEGACY_SUPPORT.get(this.___identifier);\n const fetchSyncRel = !this.hasManyRelationship.definition.isAsync && !areAllInverseRecordsLoaded(this.store, this._resource());\n return fetchSyncRel ? support.reloadHasMany(this.key, options) :\n // we cast to fix the return type since typescript and eslint don't understand async functions\n // properly\n support.getHasMany(this.key, options);\n }\n\n /**\n Reloads this has-many relationship. This causes a request to the specified\n relationship link or reloads all items currently in the relationship.\n Example\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class PostModel extends Model {\n @hasMany('comment', { async: true, inverse: null }) comments;\n }\n ```\n ```javascript\n let post = store.push({\n data: {\n type: 'post',\n id: 1,\n relationships: {\n comments: {\n data: [{ type: 'comment', id: 1 }]\n }\n }\n }\n });\n let commentsRef = post.hasMany('comments');\n commentsRef.reload().then(function(comments) {\n //...\n });\n ```\n You may also pass in an options object whose properties will be\n fed forward. This enables you to pass `adapterOptions` into the\n request given to the adapter via the reference. A full example\n can be found in the `load` method.\n Example\n ```javascript\n commentsRef.reload({ adapterOptions: { isPrivate: true } })\n ```\n @method reload\n @public\n @param {Object} options the options to pass in.\n @return {Promise} a promise that resolves with the ManyArray in this has-many relationship.\n */\n reload(options) {\n const support = LEGACY_SUPPORT.get(this.___identifier);\n return support.reloadHasMany(this.key, options);\n }\n}\ndefineSignal(HasManyReference.prototype, '_ref', 0);\nfunction isMaybeResource(object) {\n const keys = Object.keys(object).filter(k => k !== 'id' && k !== 'type' && k !== 'lid');\n return keys.length > 0;\n}\nfunction isResourceIdentiferWithRelatedLinks(value) {\n return Boolean(value && value.links && value.links.related);\n}\n\n/**\n A `BelongsToReference` is a low-level API that allows access\n and manipulation of a belongsTo relationship.\n\n It is especially useful when you're dealing with `async` relationships\n from `@ember-data/model` as it allows synchronous access to\n the relationship data if loaded, as well as APIs for loading, reloading\n the data or accessing available information without triggering a load.\n\n It may also be useful when using `sync` relationships with `@ember-data/model`\n that need to be loaded/reloaded with more precise timing than marking the\n relationship as `async` and relying on autofetch would have allowed.\n\n However,keep in mind that marking a relationship as `async: false` will introduce\n bugs into your application if the data is not always guaranteed to be available\n by the time the relationship is accessed. Ergo, it is recommended when using this\n approach to utilize `links` for unloaded relationship state instead of identifiers.\n\n Reference APIs are entangled with the relationship's underlying state,\n thus any getters or cached properties that utilize these will properly\n invalidate if the relationship state changes.\n\n References are \"stable\", meaning that multiple calls to retrieve the reference\n for a given relationship will always return the same HasManyReference.\n\n @class BelongsToReference\n @public\n */\nclass BelongsToReference {\n /**\n * The field name on the parent record for this has-many relationship.\n *\n * @property {String} key\n * @public\n */\n\n /**\n * The type of resource this relationship will contain.\n *\n * @property {String} type\n * @public\n */\n\n // unsubscribe tokens given to us by the notification manager\n\n constructor(store, graph, parentIdentifier, belongsToRelationship, key) {\n this.graph = graph;\n this.key = key;\n this.belongsToRelationship = belongsToRelationship;\n this.type = belongsToRelationship.definition.type;\n this.store = store;\n this.___identifier = parentIdentifier;\n this.___relatedToken = null;\n this.___token = store.notifications.subscribe(parentIdentifier, (_, bucket, notifiedKey) => {\n if (bucket === 'relationships' && notifiedKey === key) {\n this._ref++;\n }\n });\n\n // TODO inverse\n }\n destroy() {\n // TODO @feature we need the notification manager often enough\n // we should potentially just expose it fully public\n this.store.notifications.unsubscribe(this.___token);\n this.___token = null;\n if (this.___relatedToken) {\n this.store.notifications.unsubscribe(this.___relatedToken);\n this.___relatedToken = null;\n }\n }\n\n /**\n * The identifier of the record that this reference refers to.\n * `null` if no related record is known.\n *\n * @property {StableRecordIdentifier | null} identifier\n * @public\n */\n get identifier() {\n if (this.___relatedToken) {\n this.store.notifications.unsubscribe(this.___relatedToken);\n this.___relatedToken = null;\n }\n const resource = this._resource();\n if (resource && resource.data) {\n const identifier = this.store.identifierCache.getOrCreateRecordIdentifier(resource.data);\n this.___relatedToken = this.store.notifications.subscribe(identifier, (_, bucket, notifiedKey) => {\n if (bucket === 'identity' || bucket === 'attributes' && notifiedKey === 'id') {\n this._ref++;\n }\n });\n return identifier;\n }\n return null;\n }\n\n /**\n The `id` of the record that this reference refers to. Together, the\n `type()` and `id()` methods form a composite key for the identity\n map. This can be used to access the id of an async relationship\n without triggering a fetch that would normally happen if you\n attempted to use `record.relationship.id`.\n Example\n ```javascript\n // models/blog.js\n import Model, { belongsTo } from '@ember-data/model';\n export default class BlogModel extends Model {\n @belongsTo('user', { async: true, inverse: null }) user;\n }\n let blog = store.push({\n data: {\n type: 'blog',\n id: 1,\n relationships: {\n user: {\n data: { type: 'user', id: 1 }\n }\n }\n }\n });\n let userRef = blog.belongsTo('user');\n // get the identifier of the reference\n if (userRef.remoteType() === \"id\") {\n let id = userRef.id();\n }\n ```\n @method id\n @public\n @return {String} The id of the record in this belongsTo relationship.\n */\n static {\n decorateMethodV2(this.prototype, \"identifier\", [compat, cached]);\n }\n id() {\n return this.identifier?.id || null;\n }\n\n /**\n The link Ember Data will use to fetch or reload this belongs-to\n relationship. By default it uses only the \"related\" resource linkage.\n Example\n ```javascript\n // models/blog.js\n import Model, { belongsTo } from '@ember-data/model';\n export default Model.extend({\n user: belongsTo('user', { async: true, inverse: null })\n });\n let blog = store.push({\n data: {\n type: 'blog',\n id: 1,\n relationships: {\n user: {\n links: {\n related: '/articles/1/author'\n }\n }\n }\n }\n });\n let userRef = blog.belongsTo('user');\n // get the identifier of the reference\n if (userRef.remoteType() === \"link\") {\n let link = userRef.link();\n }\n ```\n @method link\n @public\n @return {String} The link Ember Data will use to fetch or reload this belongs-to relationship.\n */\n link() {\n const resource = this._resource();\n if (isResourceIdentiferWithRelatedLinks(resource)) {\n if (resource.links) {\n const related = resource.links.related;\n return !related || typeof related === 'string' ? related : related.href;\n }\n }\n return null;\n }\n\n /**\n * any links that have been received for this relationship\n *\n * @method links\n * @public\n * @return\n */\n links() {\n const resource = this._resource();\n return resource && resource.links ? resource.links : null;\n }\n\n /**\n The meta data for the belongs-to relationship.\n Example\n ```javascript\n // models/blog.js\n import Model, { belongsTo } from '@ember-data/model';\n export default Model.extend({\n user: belongsTo('user', { async: true, inverse: null })\n });\n let blog = store.push({\n data: {\n type: 'blog',\n id: 1,\n relationships: {\n user: {\n links: {\n related: {\n href: '/articles/1/author'\n },\n },\n meta: {\n lastUpdated: 1458014400000\n }\n }\n }\n }\n });\n let userRef = blog.belongsTo('user');\n userRef.meta() // { lastUpdated: 1458014400000 }\n ```\n @method meta\n @public\n @return {Object} The meta information for the belongs-to relationship.\n */\n meta() {\n let meta = null;\n const resource = this._resource();\n if (resource && resource.meta && typeof resource.meta === 'object') {\n meta = resource.meta;\n }\n return meta;\n }\n _resource() {\n this._ref; // subscribe\n const cache = this.store.cache;\n return cache.getRelationship(this.___identifier, this.key);\n }\n\n /**\n This returns a string that represents how the reference will be\n looked up when it is loaded. If the relationship has a link it will\n use the \"link\" otherwise it defaults to \"id\".\n Example\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class PostModel extends Model {\n @hasMany('comment', { async: true, inverse: null }) comments;\n }\n ```\n ```javascript\n let post = store.push({\n data: {\n type: 'post',\n id: 1,\n relationships: {\n comments: {\n data: [{ type: 'comment', id: 1 }]\n }\n }\n }\n });\n let commentsRef = post.hasMany('comments');\n // get the identifier of the reference\n if (commentsRef.remoteType() === \"ids\") {\n let ids = commentsRef.ids();\n } else if (commentsRef.remoteType() === \"link\") {\n let link = commentsRef.link();\n }\n ```\n @method remoteType\n @public\n @return {String} The name of the remote type. This should either be `link` or `id`\n */\n remoteType() {\n const value = this._resource();\n if (isResourceIdentiferWithRelatedLinks(value)) {\n return 'link';\n }\n return 'id';\n }\n\n /**\n `push` can be used to update the data in the relationship and EmberData\n will treat the new data as the canonical value of this relationship on\n the backend. A value of `null` (e.g. `{ data: null }`) can be passed to\n clear the relationship.\n Example model\n ```app/models/blog.js\n import Model, { belongsTo } from '@ember-data/model';\n export default class BlogModel extends Model {\n @belongsTo('user', { async: true, inverse: null }) user;\n }\n ```\n Setup some initial state, note we haven't loaded the user yet:\n ```js\n const blog = store.push({\n data: {\n type: 'blog',\n id: '1',\n relationships: {\n user: {\n data: { type: 'user', id: '1' }\n }\n }\n }\n });\n const userRef = blog.belongsTo('user');\n userRef.id(); // '1'\n ```\n Update the state using `push`, note we can do this even without\n having loaded the user yet by providing a resource-identifier.\n Both full a resource and a resource-identifier are supported.\n ```js\n await userRef.push({\n data: {\n type: 'user',\n id: '2',\n }\n });\n userRef.id(); // '2'\n ```\n You may also pass in links and meta fore the relationship, and sideload\n additional resources that might be required.\n ```js\n await userRef.push({\n data: {\n type: 'user',\n id: '2',\n },\n links: {\n related: '/articles/1/author'\n },\n meta: {\n lastUpdated: Date.now()\n },\n included: [\n {\n type: 'user-preview',\n id: '2',\n attributes: {\n username: '@runspired'\n }\n }\n ]\n });\n ```\n By default, the store will attempt to fetch the record if it is not loaded or its\n resource data is not included in the call to `push` before resolving the returned\n promise with the new state..\n Alternatively, pass `true` as the second argument to avoid fetching unloaded records\n and instead the promise will resolve with void without attempting to fetch. This is\n particularly useful if you want to update the state of the relationship without\n forcing the load of all of the associated record.\n @method push\n @public\n @param {Object} doc a JSONAPI document object describing the new value of this relationship.\n @param {Boolean} [skipFetch] if `true`, do not attempt to fetch unloaded records\n @return {Promise}\n */\n async push(doc, skipFetch) {\n const {\n store\n } = this;\n const isResourceData = doc.data && isMaybeResource(doc.data);\n const added = isResourceData ? store._push(doc, true) : doc.data ? store.identifierCache.getOrCreateRecordIdentifier(doc.data) : null;\n const {\n identifier\n } = this.belongsToRelationship;\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (added) {\n assertPolymorphicType(identifier, this.belongsToRelationship.definition, added, store);\n }\n }\n const newData = {};\n\n // only set data if it was passed in\n if (doc.data || doc.data === null) {\n newData.data = added;\n }\n if ('links' in doc) {\n newData.links = doc.links;\n }\n if ('meta' in doc) {\n newData.meta = doc.meta;\n }\n store._join(() => {\n this.graph.push({\n op: 'updateRelationship',\n record: identifier,\n field: this.key,\n value: newData\n });\n });\n if (!skipFetch) return this.load();\n }\n\n /**\n `value()` synchronously returns the current value of the belongs-to\n relationship. Unlike `record.relationshipName`, calling\n `value()` on a reference does not trigger a fetch if the async\n relationship is not yet loaded. If the relationship is not loaded\n it will always return `null`.\n Example\n ```javascript\n // models/blog.js\n import Model, { belongsTo } from '@ember-data/model';\n export default class BlogModel extends Model {\n @belongsTo('user', { async: true, inverse: null }) user;\n }\n let blog = store.push({\n data: {\n type: 'blog',\n id: 1,\n relationships: {\n user: {\n data: { type: 'user', id: 1 }\n }\n }\n }\n });\n let userRef = blog.belongsTo('user');\n userRef.value(); // null\n // provide data for reference\n userRef.push({\n data: {\n type: 'user',\n id: 1,\n attributes: {\n username: \"@user\"\n }\n }\n }).then(function(user) {\n userRef.value(); // user\n });\n ```\n @method value\n @public\n @return {Model} the record in this relationship\n */\n value() {\n const resource = this._resource();\n return resource && resource.data ? this.store.peekRecord(resource.data) : null;\n }\n\n /**\n Loads a record in a belongs-to relationship if it is not already\n loaded. If the relationship is already loaded this method does not\n trigger a new load.\n Example\n ```javascript\n // models/blog.js\n import Model, { belongsTo } from '@ember-data/model';\n export default class BlogModel extends Model {\n @belongsTo('user', { async: true, inverse: null }) user;\n }\n let blog = store.push({\n data: {\n type: 'blog',\n id: 1,\n relationships: {\n user: {\n data: { type: 'user', id: 1 }\n }\n }\n }\n });\n let userRef = blog.belongsTo('user');\n userRef.value(); // null\n userRef.load().then(function(user) {\n userRef.value() === user\n });\n ```\n You may also pass in an options object whose properties will be\n fed forward. This enables you to pass `adapterOptions` into the\n request given to the adapter via the reference.\n Example\n ```javascript\n userRef.load({ adapterOptions: { isPrivate: true } }).then(function(user) {\n userRef.value() === user;\n });\n ```\n ```app/adapters/user.js\n import Adapter from '@ember-data/adapter';\n export default class UserAdapter extends Adapter {\n findRecord(store, type, id, snapshot) {\n // In the adapter you will have access to adapterOptions.\n let adapterOptions = snapshot.adapterOptions;\n }\n });\n ```\n @method load\n @public\n @param {Object} options the options to pass in.\n @return {Promise} a promise that resolves with the record in this belongs-to relationship.\n */\n async load(options) {\n const support = LEGACY_SUPPORT.get(this.___identifier);\n const fetchSyncRel = !this.belongsToRelationship.definition.isAsync && !areAllInverseRecordsLoaded(this.store, this._resource());\n return fetchSyncRel ? support.reloadBelongsTo(this.key, options).then(() => this.value()) :\n // we cast to fix the return type since typescript and eslint don't understand async functions\n // properly\n support.getBelongsTo(this.key, options);\n }\n\n /**\n Triggers a reload of the value in this relationship. If the\n remoteType is `\"link\"` Ember Data will use the relationship link to\n reload the relationship. Otherwise it will reload the record by its\n id.\n Example\n ```javascript\n // models/blog.js\n import Model, { belongsTo } from '@ember-data/model';\n export default class BlogModel extends Model {\n @belongsTo('user', { async: true, inverse: null }) user;\n }\n let blog = store.push({\n data: {\n type: 'blog',\n id: 1,\n relationships: {\n user: {\n data: { type: 'user', id: 1 }\n }\n }\n }\n });\n let userRef = blog.belongsTo('user');\n userRef.reload().then(function(user) {\n userRef.value() === user\n });\n ```\n You may also pass in an options object whose properties will be\n fed forward. This enables you to pass `adapterOptions` into the\n request given to the adapter via the reference. A full example\n can be found in the `load` method.\n Example\n ```javascript\n userRef.reload({ adapterOptions: { isPrivate: true } })\n ```\n @method reload\n @public\n @param {Object} options the options to pass in.\n @return {Promise} a promise that resolves with the record in this belongs-to relationship after the reload has completed.\n */\n reload(options) {\n const support = LEGACY_SUPPORT.get(this.___identifier);\n return support.reloadBelongsTo(this.key, options).then(() => this.value());\n }\n}\ndefineSignal(BelongsToReference.prototype, '_ref', 0);\nconst LEGACY_SUPPORT = getOrSetGlobal('LEGACY_SUPPORT', new Map());\nfunction lookupLegacySupport(record) {\n const identifier = recordIdentifierFor(record);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a record`);\n }\n })(identifier) : {};\n let support = LEGACY_SUPPORT.get(identifier);\n if (!support) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Memory Leak Detected`);\n }\n })(!record.isDestroyed && !record.isDestroying) : {};\n support = new LegacySupport(record);\n LEGACY_SUPPORT.set(identifier, support);\n LEGACY_SUPPORT.set(record, support);\n }\n return support;\n}\nclass LegacySupport {\n constructor(record) {\n this.record = record;\n this.store = storeFor(record);\n this.identifier = recordIdentifierFor(record);\n this.cache = peekCache(record);\n if (macroCondition(dependencySatisfies('@ember-data/graph', '*'))) {\n const graphFor = importSync('@ember-data/graph/-private').graphFor;\n this.graph = graphFor(this.store);\n }\n this._manyArrayCache = Object.create(null);\n this._relationshipPromisesCache = Object.create(null);\n this._relationshipProxyCache = Object.create(null);\n this._pending = Object.create(null);\n this.references = Object.create(null);\n }\n _syncArray(array) {\n // It’s possible the parent side of the relationship may have been destroyed by this point\n if (this.isDestroyed || this.isDestroying) {\n return;\n }\n const currentState = array[SOURCE];\n const identifier = this.identifier;\n const [identifiers, jsonApi] = this._getCurrentState(identifier, array.key);\n if (jsonApi.meta) {\n array.meta = jsonApi.meta;\n }\n if (jsonApi.links) {\n array.links = jsonApi.links;\n }\n currentState.length = 0;\n fastPush(currentState, identifiers);\n }\n mutate(mutation) {\n this.cache.mutate(mutation);\n }\n _findBelongsTo(key, resource, relationship, options) {\n // TODO @runspired follow up if parent isNew then we should not be attempting load here\n // TODO @runspired follow up on whether this should be in the relationship requests cache\n return this._findBelongsToByJsonApiResource(resource, this.identifier, relationship, options).then(identifier => handleCompletedRelationshipRequest(this, key, relationship, identifier), e => handleCompletedRelationshipRequest(this, key, relationship, null, e));\n }\n reloadBelongsTo(key, options) {\n const loadingPromise = this._relationshipPromisesCache[key];\n if (loadingPromise) {\n return loadingPromise;\n }\n const relationship = this.graph.get(this.identifier, key);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected ${key} to be a belongs-to relationship`);\n }\n })(isBelongsTo(relationship)) : {};\n const resource = this.cache.getRelationship(this.identifier, key);\n relationship.state.hasFailedLoadAttempt = false;\n relationship.state.shouldForceReload = true;\n const promise = this._findBelongsTo(key, resource, relationship, options);\n if (this._relationshipProxyCache[key]) {\n // @ts-expect-error\n return this._updatePromiseProxyFor('belongsTo', key, {\n promise\n });\n }\n return promise;\n }\n getBelongsTo(key, options) {\n const {\n identifier,\n cache\n } = this;\n const resource = cache.getRelationship(this.identifier, key);\n const relatedIdentifier = resource && resource.data ? resource.data : null;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a stable identifier`);\n }\n })(!relatedIdentifier || isStableIdentifier(relatedIdentifier)) : {};\n const store = this.store;\n const relationship = this.graph.get(this.identifier, key);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected ${key} to be a belongs-to relationship`);\n }\n })(isBelongsTo(relationship)) : {};\n const isAsync = relationship.definition.isAsync;\n const _belongsToState = {\n key,\n store,\n legacySupport: this,\n modelName: relationship.definition.type\n };\n if (isAsync) {\n if (relationship.state.hasFailedLoadAttempt) {\n return this._relationshipProxyCache[key];\n }\n const promise = this._findBelongsTo(key, resource, relationship, options);\n const isLoaded = relatedIdentifier && store._instanceCache.recordIsLoaded(relatedIdentifier);\n return this._updatePromiseProxyFor('belongsTo', key, {\n promise,\n content: isLoaded ? store._instanceCache.getRecord(relatedIdentifier) : null,\n _belongsToState\n });\n } else {\n if (relatedIdentifier === null) {\n return null;\n } else {\n const toReturn = store._instanceCache.getRecord(relatedIdentifier);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You looked up the '${key}' relationship on a '${identifier.type}' with id ${identifier.id || 'null'} but some of the associated records were not loaded. Either make sure they are all loaded together with the parent record, or specify that the relationship is async (\\`belongsTo(, { async: true, inverse: })\\`)`);\n }\n })(toReturn === null || store._instanceCache.recordIsLoaded(relatedIdentifier, true)) : {};\n return toReturn;\n }\n }\n }\n setDirtyBelongsTo(key, value) {\n return this.cache.mutate({\n op: 'replaceRelatedRecord',\n record: this.identifier,\n field: key,\n value: extractIdentifierFromRecord(value)\n },\n // @ts-expect-error\n true);\n }\n _getCurrentState(identifier, field) {\n const jsonApi = this.cache.getRelationship(identifier, field);\n const cache = this.store._instanceCache;\n const identifiers = [];\n if (jsonApi.data) {\n for (let i = 0; i < jsonApi.data.length; i++) {\n const relatedIdentifier = jsonApi.data[i];\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a stable identifier`);\n }\n })(isStableIdentifier(relatedIdentifier)) : {};\n if (cache.recordIsLoaded(relatedIdentifier, true)) {\n identifiers.push(relatedIdentifier);\n }\n }\n }\n return [identifiers, jsonApi];\n }\n getManyArray(key, definition) {\n if (macroCondition(dependencySatisfies('@ember-data/graph', '*'))) {\n let manyArray = this._manyArrayCache[key];\n if (!definition) {\n definition = this.graph.get(this.identifier, key).definition;\n }\n if (!manyArray) {\n const [identifiers, doc] = this._getCurrentState(this.identifier, key);\n manyArray = new RelatedCollection({\n store: this.store,\n type: definition.type,\n identifier: this.identifier,\n cache: this.cache,\n identifiers,\n key,\n meta: doc.meta || null,\n links: doc.links || null,\n isPolymorphic: definition.isPolymorphic,\n isAsync: definition.isAsync,\n _inverseIsAsync: definition.inverseIsAsync,\n manager: this,\n isLoaded: !definition.isAsync,\n allowMutation: true\n });\n this._manyArrayCache[key] = manyArray;\n }\n return manyArray;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error('hasMany only works with the @ember-data/json-api package');\n }\n })() : {};\n }\n fetchAsyncHasMany(key, relationship, manyArray, options) {\n if (macroCondition(dependencySatisfies('@ember-data/graph', '*'))) {\n let loadingPromise = this._relationshipPromisesCache[key];\n if (loadingPromise) {\n return loadingPromise;\n }\n const jsonApi = this.cache.getRelationship(this.identifier, key);\n const promise = this._findHasManyByJsonApiResource(jsonApi, this.identifier, relationship, options);\n if (!promise) {\n manyArray.isLoaded = true;\n return Promise.resolve(manyArray);\n }\n loadingPromise = promise.then(() => handleCompletedRelationshipRequest(this, key, relationship, manyArray), e => handleCompletedRelationshipRequest(this, key, relationship, manyArray, e));\n this._relationshipPromisesCache[key] = loadingPromise;\n return loadingPromise;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error('hasMany only works with the @ember-data/json-api package');\n }\n })() : {};\n }\n reloadHasMany(key, options) {\n if (macroCondition(dependencySatisfies('@ember-data/graph', '*'))) {\n const loadingPromise = this._relationshipPromisesCache[key];\n if (loadingPromise) {\n return loadingPromise;\n }\n const relationship = this.graph.get(this.identifier, key);\n const {\n definition,\n state\n } = relationship;\n state.hasFailedLoadAttempt = false;\n state.shouldForceReload = true;\n const manyArray = this.getManyArray(key, definition);\n const promise = this.fetchAsyncHasMany(key, relationship, manyArray, options);\n if (this._relationshipProxyCache[key]) {\n return this._updatePromiseProxyFor('hasMany', key, {\n promise\n });\n }\n return promise;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`hasMany only works with the @ember-data/json-api package`);\n }\n })() : {};\n }\n getHasMany(key, options) {\n if (macroCondition(dependencySatisfies('@ember-data/graph', '*'))) {\n const relationship = this.graph.get(this.identifier, key);\n const {\n definition,\n state\n } = relationship;\n const manyArray = this.getManyArray(key, definition);\n if (definition.isAsync) {\n if (state.hasFailedLoadAttempt) {\n return this._relationshipProxyCache[key];\n }\n const promise = this.fetchAsyncHasMany(key, relationship, manyArray, options);\n return this._updatePromiseProxyFor('hasMany', key, {\n promise,\n content: manyArray\n });\n } else {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You looked up the '${key}' relationship on a '${this.identifier.type}' with id ${this.identifier.id || 'null'} but some of the associated records were not loaded. Either make sure they are all loaded together with the parent record, or specify that the relationship is async ('hasMany(, { async: true, inverse: })')`);\n }\n })(!anyUnloaded(this.store, relationship)) : {};\n return manyArray;\n }\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`hasMany only works with the @ember-data/json-api package`);\n }\n })() : {};\n }\n _updatePromiseProxyFor(kind, key, args) {\n let promiseProxy = this._relationshipProxyCache[key];\n if (kind === 'hasMany') {\n const {\n promise,\n content\n } = args;\n if (promiseProxy) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a PromiseManyArray`);\n }\n })('_update' in promiseProxy) : {};\n promiseProxy._update(promise, content);\n } else {\n promiseProxy = this._relationshipProxyCache[key] = new PromiseManyArray(promise, content);\n }\n return promiseProxy;\n }\n if (promiseProxy) {\n const {\n promise,\n content\n } = args;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a PromiseBelongsTo`);\n }\n })('_belongsToState' in promiseProxy) : {};\n if (content !== undefined) {\n promiseProxy.set('content', content);\n }\n void promiseProxy.set('promise', promise);\n } else {\n promiseProxy = PromiseBelongsTo.create(args);\n this._relationshipProxyCache[key] = promiseProxy;\n }\n return promiseProxy;\n }\n referenceFor(kind, name) {\n let reference = this.references[name];\n if (!reference) {\n if (macroCondition(!dependencySatisfies('@ember-data/graph', '*'))) {\n // TODO @runspired while this feels odd, it is not a regression in capability because we do\n // not today support references pulling from RecordDatas other than our own\n // because of the intimate API access involved. This is something we will need to redesign.\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`snapshot.belongsTo only supported for @ember-data/json-api`);\n }\n })() : {};\n }\n const {\n graph,\n identifier\n } = this;\n const relationship = graph.get(identifier, name);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (kind) {\n const modelName = identifier.type;\n const actualRelationshipKind = relationship.definition.kind;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You tried to get the '${name}' relationship on a '${modelName}' via record.${kind}('${name}'), but the relationship is of kind '${actualRelationshipKind}'. Use record.${actualRelationshipKind}('${name}') instead.`);\n }\n })(actualRelationshipKind === kind) : {};\n }\n }\n const relationshipKind = relationship.definition.kind;\n if (relationshipKind === 'belongsTo') {\n reference = new BelongsToReference(this.store, graph, identifier, relationship, name);\n } else if (relationshipKind === 'hasMany') {\n reference = new HasManyReference(this.store, graph, identifier, relationship, name);\n }\n this.references[name] = reference;\n }\n return reference;\n }\n _findHasManyByJsonApiResource(resource, parentIdentifier, relationship, options = {}) {\n if (macroCondition(dependencySatisfies('@ember-data/graph', '*'))) {\n if (!resource) {\n return;\n }\n const {\n definition,\n state\n } = relationship;\n upgradeStore(this.store);\n const adapter = this.store.adapterFor?.(definition.type);\n const {\n isStale,\n hasDematerializedInverse,\n hasReceivedData,\n isEmpty,\n shouldForceReload\n } = state;\n const allInverseRecordsAreLoaded = areAllInverseRecordsLoaded(this.store, resource);\n const identifiers = resource.data;\n const shouldFindViaLink = resource.links && resource.links.related && (typeof adapter?.findHasMany === 'function' || typeof identifiers === 'undefined') && (shouldForceReload || hasDematerializedInverse || isStale || !allInverseRecordsAreLoaded && !isEmpty);\n const field = this.store.schema.fields({\n type: definition.inverseType\n }).get(definition.key);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a hasMany field definition for ${definition.inverseType}.${definition.key}`);\n }\n })(field && field.kind === 'hasMany') : {};\n const request = {\n useLink: shouldFindViaLink,\n field,\n links: resource.links,\n meta: resource.meta,\n options,\n record: parentIdentifier\n };\n\n // fetch via link\n if (shouldFindViaLink) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected collection to be an array`);\n }\n })(!identifiers || Array.isArray(identifiers)) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected stable identifiers`);\n }\n })(!identifiers || identifiers.every(isStableIdentifier)) : {};\n return this.store.request({\n op: 'findHasMany',\n records: identifiers || [],\n data: request,\n cacheOptions: {\n [Symbol.for('wd:skip-cache')]: true\n }\n });\n }\n const preferLocalCache = hasReceivedData && !isEmpty;\n const hasLocalPartialData = hasDematerializedInverse || isEmpty && Array.isArray(identifiers) && identifiers.length > 0;\n const attemptLocalCache = !shouldForceReload && !isStale && (preferLocalCache || hasLocalPartialData);\n if (attemptLocalCache && allInverseRecordsAreLoaded) {\n return;\n }\n const hasData = hasReceivedData && !isEmpty;\n if (attemptLocalCache || hasData || hasLocalPartialData) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected collection to be an array`);\n }\n })(Array.isArray(identifiers)) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected stable identifiers`);\n }\n })(identifiers.every(isStableIdentifier)) : {};\n options.reload = options.reload || !attemptLocalCache || undefined;\n return this.store.request({\n op: 'findHasMany',\n records: identifiers,\n data: request,\n cacheOptions: {\n [Symbol.for('wd:skip-cache')]: true\n }\n });\n }\n\n // we were explicitly told we have no data and no links.\n // TODO if the relationshipIsStale, should we hit the adapter anyway?\n return;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`hasMany only works with the @ember-data/json-api package`);\n }\n })() : {};\n }\n _findBelongsToByJsonApiResource(resource, parentIdentifier, relationship, options = {}) {\n if (!resource) {\n return Promise.resolve(null);\n }\n const key = relationship.definition.key;\n\n // interleaved promises mean that we MUST cache this here\n // in order to prevent infinite re-render if the request\n // fails.\n if (this._pending[key]) {\n return this._pending[key];\n }\n const identifier = resource.data ? resource.data : null;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a stable identifier`);\n }\n })(!identifier || isStableIdentifier(identifier)) : {};\n const {\n isStale,\n hasDematerializedInverse,\n hasReceivedData,\n isEmpty,\n shouldForceReload\n } = relationship.state;\n const allInverseRecordsAreLoaded = areAllInverseRecordsLoaded(this.store, resource);\n const shouldFindViaLink = resource.links?.related && (shouldForceReload || hasDematerializedInverse || isStale || !allInverseRecordsAreLoaded && !isEmpty);\n const field = this.store.schema.fields(this.identifier).get(relationship.definition.key);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Attempted to access a belongsTo relationship but no definition exists for it`);\n }\n })(field && field.kind === 'belongsTo') : {};\n const request = {\n useLink: shouldFindViaLink,\n field,\n links: resource.links,\n meta: resource.meta,\n options,\n record: parentIdentifier\n };\n\n // fetch via link\n if (shouldFindViaLink) {\n const future = this.store.request({\n op: 'findBelongsTo',\n records: identifier ? [identifier] : [],\n data: request,\n cacheOptions: {\n [Symbol.for('wd:skip-cache')]: true\n }\n });\n this._pending[key] = future.then(doc => doc.content).finally(() => {\n this._pending[key] = undefined;\n });\n return this._pending[key];\n }\n const preferLocalCache = hasReceivedData && allInverseRecordsAreLoaded && !isEmpty;\n const hasLocalPartialData = hasDematerializedInverse || isEmpty && resource.data;\n // null is explicit empty, undefined is \"we don't know anything\"\n const localDataIsEmpty = !identifier;\n const attemptLocalCache = !shouldForceReload && !isStale && (preferLocalCache || hasLocalPartialData);\n\n // we dont need to fetch and are empty\n if (attemptLocalCache && localDataIsEmpty) {\n return Promise.resolve(null);\n }\n\n // we dont need to fetch because we are local state\n const resourceIsLocal = identifier?.id === null;\n if (attemptLocalCache && allInverseRecordsAreLoaded || resourceIsLocal) {\n return Promise.resolve(identifier);\n }\n\n // we may need to fetch\n if (identifier) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot fetch belongs-to relationship with no information`);\n }\n })(identifier) : {};\n options.reload = options.reload || !attemptLocalCache || undefined;\n this._pending[key] = this.store.request({\n op: 'findBelongsTo',\n records: [identifier],\n data: request,\n cacheOptions: {\n [Symbol.for('wd:skip-cache')]: true\n }\n }).then(doc => doc.content).finally(() => {\n this._pending[key] = undefined;\n });\n return this._pending[key];\n }\n\n // we were explicitly told we have no data and no links.\n // TODO if the relationshipIsStale, should we hit the adapter anyway?\n return Promise.resolve(null);\n }\n destroy() {\n this.isDestroying = true;\n let cache = this._manyArrayCache;\n this._manyArrayCache = Object.create(null);\n Object.keys(cache).forEach(key => {\n cache[key].destroy();\n });\n cache = this._relationshipProxyCache;\n this._relationshipProxyCache = Object.create(null);\n Object.keys(cache).forEach(key => {\n const proxy = cache[key];\n if (proxy.destroy) {\n proxy.destroy();\n }\n });\n cache = this.references;\n this.references = Object.create(null);\n Object.keys(cache).forEach(key => {\n cache[key].destroy();\n });\n this.isDestroyed = true;\n }\n}\nfunction handleCompletedRelationshipRequest(recordExt, key, relationship, value, error) {\n delete recordExt._relationshipPromisesCache[key];\n relationship.state.shouldForceReload = false;\n const isHasMany = relationship.definition.kind === 'hasMany';\n if (isHasMany) {\n // we don't notify the record property here to avoid refetch\n // only the many array\n value.notify();\n }\n if (error) {\n relationship.state.hasFailedLoadAttempt = true;\n const proxy = recordExt._relationshipProxyCache[key];\n // belongsTo relationships are sometimes unloaded\n // when a load fails, in this case we need\n // to make sure that we aren't proxying\n // to destroyed content\n // for the sync belongsTo reload case there will be no proxy\n // for the async reload case there will be no proxy if the ui\n // has never been accessed\n if (proxy && !isHasMany) {\n // @ts-expect-error unsure why this is not resolving the boolean but async belongsTo is weird\n if (proxy.content && proxy.content.isDestroying) {\n proxy.set('content', null);\n }\n recordExt.store.notifications._flush();\n }\n throw error;\n }\n if (isHasMany) {\n value.isLoaded = true;\n } else {\n recordExt.store.notifications._flush();\n }\n relationship.state.hasFailedLoadAttempt = false;\n // only set to not stale if no error is thrown\n relationship.state.isStale = false;\n return isHasMany || !value ? value : recordExt.store.peekRecord(value);\n}\nfunction extractIdentifierFromRecord(record) {\n if (!record) {\n return null;\n }\n return recordIdentifierFor(record);\n}\nfunction anyUnloaded(store, relationship) {\n const graph = store._graph;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a Graph instance to be available`);\n }\n })(graph) : {};\n const relationshipData = graph.getData(relationship.identifier, relationship.definition.key);\n const state = relationshipData.data;\n const cache = store._instanceCache;\n const unloaded = state?.find(s => {\n const isLoaded = cache.recordIsLoaded(s, true);\n return !isLoaded;\n });\n return unloaded || false;\n}\nfunction areAllInverseRecordsLoaded(store, resource) {\n const instanceCache = store._instanceCache;\n const identifiers = resource.data;\n if (Array.isArray(identifiers)) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected stable identifiers`);\n }\n })(identifiers.every(isStableIdentifier)) : {};\n // treat as collection\n // check for unloaded records\n return identifiers.every(identifier => instanceCache.recordIsLoaded(identifier));\n }\n\n // treat as single resource\n if (!identifiers) return true;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected stable identifiers`);\n }\n })(isStableIdentifier(identifiers)) : {};\n return instanceCache.recordIsLoaded(identifiers);\n}\nfunction isBelongsTo(relationship) {\n return relationship.definition.kind === 'belongsTo';\n}\n\n// we force the type here to our own construct because mixin and extend patterns\n// lose generic signatures. We also do this because we need to Omit `clear` from\n// the type of ArrayProxy as we override it's signature.\nconst ArrayProxyWithCustomOverrides = ArrayProxy;\n\n/**\n Holds validation errors for a given record, organized by attribute names.\n\n This class is not directly instantiable.\n\n Every `Model` has an `errors` property that is an instance of\n `Errors`. This can be used to display validation error\n messages returned from the server when a `record.save()` rejects.\n\n For Example, if you had a `User` model that looked like this:\n\n ```app/models/user.js\n import Model, { attr } from '@ember-data/model';\n\n export default class UserModel extends Model {\n @attr('string') username;\n @attr('string') email;\n }\n ```\n And you attempted to save a record that did not validate on the backend:\n\n ```javascript\n let user = store.createRecord('user', {\n username: 'tomster',\n email: 'invalidEmail'\n });\n user.save();\n ```\n\n Your backend would be expected to return an error response that described\n the problem, so that error messages can be generated on the app.\n\n API responses will be translated into instances of `Errors` differently,\n depending on the specific combination of adapter and serializer used. You\n may want to check the documentation or the source code of the libraries\n that you are using, to know how they expect errors to be communicated.\n\n Errors can be displayed to the user by accessing their property name\n to get an array of all the error objects for that property. Each\n error object is a JavaScript object with two keys:\n\n - `message` A string containing the error message from the backend\n - `attribute` The name of the property associated with this error message\n\n ```handlebars\n \n {{#each @model.errors.username as |error|}}\n
\n {{error.message}}\n
\n {{/each}}\n\n \n {{#each @model.errors.email as |error|}}\n
\n {{error.message}}\n
\n {{/each}}\n ```\n\n You can also access the special `messages` property on the error\n object to get an array of all the error strings.\n\n ```handlebars\n {{#each @model.errors.messages as |message|}}\n
\n {{message}}\n
\n {{/each}}\n ```\n\n @class Errors\n @public\n @extends Ember.ArrayProxy\n */\nclass Errors extends ArrayProxyWithCustomOverrides {\n /**\n @property errorsByAttributeName\n @type {MapWithDefault}\n @private\n */\n get errorsByAttributeName() {\n return new Map();\n }\n\n /**\n Returns errors for a given attribute\n ```javascript\n let user = store.createRecord('user', {\n username: 'tomster',\n email: 'invalidEmail'\n });\n user.save().catch(function(){\n user.errors.errorsFor('email'); // returns:\n // [{attribute: \"email\", message: \"Doesn't look like a valid email.\"}]\n });\n ```\n @method errorsFor\n @public\n @param {String} attribute\n @return {Array}\n */\n static {\n decorateMethodV2(this.prototype, \"errorsByAttributeName\", [computed()]);\n }\n errorsFor(attribute) {\n const map = this.errorsByAttributeName;\n let errors = map.get(attribute);\n if (errors === undefined) {\n errors = A();\n map.set(attribute, errors);\n }\n\n // Errors may be a native array with extensions turned on. Since we access\n // the array via a method, and not a computed or using `Ember.get`, it does\n // not entangle properly with autotracking, so we entangle manually by\n // getting the `[]` property.\n get(errors, '[]');\n return errors;\n }\n\n /**\n An array containing all of the error messages for this\n record. This is useful for displaying all errors to the user.\n ```handlebars\n {{#each @model.errors.messages as |message|}}\n
\n {{message}}\n
\n {{/each}}\n ```\n @property messages\n @public\n @type {Array}\n */\n static {\n decorateFieldV2(this.prototype, \"messages\", [mapBy('content', 'message')]);\n }\n #messages = (initializeDeferredDecorator(this, \"messages\"), void 0);\n /**\n @property content\n @type {Array}\n @private\n */\n get content() {\n return A();\n }\n\n /**\n @method unknownProperty\n @private\n */\n static {\n decorateMethodV2(this.prototype, \"content\", [computed()]);\n }\n unknownProperty(attribute) {\n const errors = this.errorsFor(attribute);\n if (errors.length === 0) {\n return undefined;\n }\n return errors;\n }\n\n /**\n Total number of errors.\n @property length\n @type {Number}\n @public\n @readOnly\n */\n\n /**\n `true` if we have no errors.\n @property isEmpty\n @type {Boolean}\n @public\n @readOnly\n */\n static {\n decorateFieldV2(this.prototype, \"isEmpty\", [not('length')]);\n }\n #isEmpty = (initializeDeferredDecorator(this, \"isEmpty\"), void 0);\n /**\n Manually adds errors to the record. This will trigger the `becameInvalid` event/ lifecycle method on\n the record and transition the record into an `invalid` state.\n Example\n ```javascript\n let errors = user.errors;\n // add multiple errors\n errors.add('password', [\n 'Must be at least 12 characters',\n 'Must contain at least one symbol',\n 'Cannot contain your name'\n ]);\n errors.errorsFor('password');\n // =>\n // [\n // { attribute: 'password', message: 'Must be at least 12 characters' },\n // { attribute: 'password', message: 'Must contain at least one symbol' },\n // { attribute: 'password', message: 'Cannot contain your name' },\n // ]\n // add a single error\n errors.add('username', 'This field is required');\n errors.errorsFor('username');\n // =>\n // [\n // { attribute: 'username', message: 'This field is required' },\n // ]\n ```\n @method add\n @public\n @param {string} attribute - the property name of an attribute or relationship\n @param {string[]|string} messages - an error message or array of error messages for the attribute\n */\n add(attribute, messages) {\n const errors = this._findOrCreateMessages(attribute, messages);\n this.addObjects(errors);\n this.errorsFor(attribute).addObjects(errors);\n this.__record.currentState.notify('isValid');\n this.notifyPropertyChange(attribute);\n }\n\n /**\n @method _findOrCreateMessages\n @private\n */\n _findOrCreateMessages(attribute, messages) {\n const errors = this.errorsFor(attribute);\n const messagesArray = Array.isArray(messages) ? messages : [messages];\n const _messages = new Array(messagesArray.length);\n for (let i = 0; i < messagesArray.length; i++) {\n const message = messagesArray[i];\n const err = errors.findBy('message', message);\n if (err) {\n _messages[i] = err;\n } else {\n _messages[i] = {\n attribute: attribute,\n message\n };\n }\n }\n return _messages;\n }\n\n /**\n Manually removes all errors for a given member from the record.\n This will transition the record into a `valid` state, and\n triggers the `becameValid` event and lifecycle method.\n Example:\n ```javascript\n let errors = user.errors;\n errors.add('phone', ['error-1', 'error-2']);\n errors.errorsFor('phone');\n // =>\n // [\n // { attribute: 'phone', message: 'error-1' },\n // { attribute: 'phone', message: 'error-2' },\n // ]\n errors.remove('phone');\n errors.errorsFor('phone');\n // => undefined\n ```\n @method remove\n @public\n @param {string} member - the property name of an attribute or relationship\n */\n remove(attribute) {\n if (this.isEmpty) {\n return;\n }\n const content = this.rejectBy('attribute', attribute);\n this.content.setObjects(content);\n\n // Although errorsByAttributeName.delete is technically enough to sync errors state, we also\n // must mutate the array as well for autotracking\n const errors = this.errorsFor(attribute);\n for (let i = 0; i < errors.length; i++) {\n if (errors[i].attribute === attribute) {\n // .replace from Ember.NativeArray is necessary. JS splice will not work.\n errors.replace(i, 1);\n }\n }\n this.errorsByAttributeName.delete(attribute);\n this.__record.currentState.notify('isValid');\n this.notifyPropertyChange(attribute);\n this.notifyPropertyChange('length');\n }\n\n /**\n Manually clears all errors for the record.\n This will transition the record into a `valid` state, and\n will trigger the `becameValid` event and lifecycle method.\n Example:\n ```javascript\n let errors = user.errors;\n errors.add('username', ['error-a']);\n errors.add('phone', ['error-1', 'error-2']);\n errors.errorsFor('username');\n // =>\n // [\n // { attribute: 'username', message: 'error-a' },\n // ]\n errors.errorsFor('phone');\n // =>\n // [\n // { attribute: 'phone', message: 'error-1' },\n // { attribute: 'phone', message: 'error-2' },\n // ]\n errors.clear();\n errors.errorsFor('username');\n // => undefined\n errors.errorsFor('phone');\n // => undefined\n errors.messages\n // => []\n ```\n @method clear\n @public\n */\n clear() {\n if (this.isEmpty) {\n return;\n }\n const errorsByAttributeName = this.errorsByAttributeName;\n const attributes = [];\n errorsByAttributeName.forEach(function (_, attribute) {\n attributes.push(attribute);\n });\n errorsByAttributeName.clear();\n attributes.forEach(attribute => {\n this.notifyPropertyChange(attribute);\n });\n this.__record.currentState.notify('isValid');\n super.clear();\n }\n\n /**\n Checks if there are error messages for the given attribute.\n ```app/controllers/user/edit.js\n export default class UserEditController extends Controller {\n @action\n save(user) {\n if (user.errors.has('email')) {\n return alert('Please update your email before attempting to save.');\n }\n user.save();\n }\n }\n ```\n @method has\n @public\n @param {String} attribute\n @return {Boolean} true if there some errors on given attribute\n */\n has(attribute) {\n return this.errorsFor(attribute).length > 0;\n }\n}\nfunction rollbackAttributes() {\n const {\n currentState\n } = this;\n const {\n isNew\n } = currentState;\n this[RecordStore]._join(() => {\n peekCache(this).rollbackAttrs(recordIdentifierFor$1(this));\n this.errors.clear();\n currentState.cleanErrorRequests();\n if (isNew) {\n this.unloadRecord();\n }\n });\n}\nfunction unloadRecord() {\n if (this.currentState.isNew && (this.isDestroyed || this.isDestroying)) {\n return;\n }\n this[RecordStore].unloadRecord(this);\n}\nfunction belongsTo(prop) {\n return lookupLegacySupport(this).referenceFor('belongsTo', prop);\n}\nfunction hasMany(prop) {\n return lookupLegacySupport(this).referenceFor('hasMany', prop);\n}\nfunction reload(options = {}) {\n options.isReloading = true;\n options.reload = true;\n const identifier = recordIdentifierFor$1(this);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You cannot reload a record without an ID`);\n }\n })(identifier.id) : {};\n this.isReloading = true;\n const promise = this[RecordStore].request({\n op: 'findRecord',\n data: {\n options,\n record: identifier\n },\n cacheOptions: {\n [Symbol.for('wd:skip-cache')]: true\n }\n }).then(() => this).finally(() => {\n this.isReloading = false;\n });\n return promise;\n}\nfunction changedAttributes() {\n return peekCache(this).changedAttrs(recordIdentifierFor$1(this));\n}\nfunction serialize(options) {\n upgradeStore(this[RecordStore]);\n return this[RecordStore].serializeRecord(this, options);\n}\nfunction deleteRecord() {\n // ensure we've populated currentState prior to deleting a new record\n if (this.currentState) {\n this[RecordStore].deleteRecord(this);\n }\n}\nfunction save(options) {\n let promise;\n if (this.currentState.isNew && this.currentState.isDeleted) {\n promise = Promise.resolve(this);\n } else {\n this.errors.clear();\n promise = this[RecordStore].saveRecord(this, options);\n }\n return promise;\n}\nfunction destroyRecord(options) {\n const {\n isNew\n } = this.currentState;\n this.deleteRecord();\n if (isNew) {\n return Promise.resolve(this);\n }\n return this.save(options).then(_ => {\n this.unloadRecord();\n return this;\n });\n}\nfunction createSnapshot() {\n const store = this[RecordStore];\n upgradeStore(store);\n if (!store._fetchManager) {\n const FetchManager = importSync('@ember-data/legacy-compat/-private').FetchManager;\n store._fetchManager = new FetchManager(store);\n }\n\n // @ts-expect-error Typescript isn't able to curry narrowed args that are divorced from each other.\n return store._fetchManager.createSnapshot(recordIdentifierFor$1(this));\n}\nfunction notifyChanges(identifier, value, key, record, store) {\n if (value === 'attributes') {\n if (key) {\n notifyAttribute(store, identifier, key, record);\n } else {\n record.eachAttribute(name => {\n notifyAttribute(store, identifier, name, record);\n });\n }\n } else if (value === 'relationships') {\n if (key) {\n const meta = record.constructor.relationshipsByName.get(key);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected to find a relationship for ${key} on ${identifier.type}`);\n }\n })(meta) : {};\n notifyRelationship(identifier, key, record, meta);\n } else {\n record.eachRelationship((name, meta) => {\n notifyRelationship(identifier, name, record, meta);\n });\n }\n } else if (value === 'identity') {\n record.notifyPropertyChange('id');\n }\n}\nfunction notifyRelationship(identifier, key, record, meta) {\n if (meta.kind === 'belongsTo') {\n record.notifyPropertyChange(key);\n } else if (meta.kind === 'hasMany') {\n const support = LEGACY_SUPPORT.get(identifier);\n const manyArray = support && support._manyArrayCache[key];\n const hasPromise = support && support._relationshipPromisesCache[key];\n if (manyArray && hasPromise) {\n // do nothing, we will notify the ManyArray directly\n // once the fetch has completed.\n return;\n }\n if (manyArray) {\n manyArray.notify();\n\n //We need to notifyPropertyChange in the adding case because we need to make sure\n //we fetch the newly added record in case it is unloaded\n //TODO(Igor): Consider whether we could do this only if the record state is unloaded\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected options to exist on relationship meta`);\n }\n })(meta.options) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected async to exist on relationship meta options`);\n }\n })('async' in meta.options) : {};\n if (meta.options.async) {\n record.notifyPropertyChange(key);\n }\n }\n }\n}\nfunction notifyAttribute(store, identifier, key, record) {\n const currentValue = cacheFor(record, key);\n const cache = store.cache;\n if (currentValue !== cache.getAttr(identifier, key)) {\n record.notifyPropertyChange(key);\n }\n}\nconst SOURCE_POINTER_REGEXP = /^\\/?data\\/(attributes|relationships)\\/(.*)/;\nconst SOURCE_POINTER_PRIMARY_REGEXP = /^\\/?data/;\nconst PRIMARY_ATTRIBUTE_KEY = 'base';\nfunction isInvalidError(error) {\n return !!error && error instanceof Error && 'isAdapterError' in error && error.isAdapterError === true && 'code' in error && error.code === 'InvalidError';\n}\n\n/**\n * A decorator that caches a getter while\n * providing the ability to bust that cache\n * when we so choose in a way that notifies\n * tracking systems.\n *\n * @internal\n */\nfunction tagged(_target, key, desc) {\n // eslint-disable-next-line @typescript-eslint/unbound-method\n const getter = desc.get;\n // eslint-disable-next-line @typescript-eslint/unbound-method\n const setter = desc.set;\n desc.get = function () {\n const signal = getSignal(this, key, true);\n subscribe(signal);\n if (signal.shouldReset) {\n signal.shouldReset = false;\n signal.lastValue = getter.call(this);\n }\n return signal.lastValue;\n };\n desc.set = function (v) {\n getSignal(this, key, true); // ensure signal is setup in case we want to use it.\n // probably notify here but not yet.\n setter.call(this, v);\n };\n compat(desc);\n return desc;\n}\nfunction notifySignal(obj, key) {\n const signal = peekSignal(obj, key);\n if (signal) {\n signal.shouldReset = true;\n addToTransaction(signal);\n }\n}\n\n/**\nHistorically EmberData managed a state machine\nfor each record, the localState for which\nwas reflected onto Model.\n\nThis implements the flags and stateName for backwards compat\nwith the state tree that used to be possible (listed below).\n\nstateName and dirtyType are candidates for deprecation.\n\nroot\n empty\n deleted // hidden from stateName\n preloaded // hidden from stateName\n\n loading\n empty // hidden from stateName\n preloaded // hidden from stateName\n\n loaded\n saved\n updated\n uncommitted\n invalid\n inFlight\n created\n uncommitted\n invalid\n inFlight\n\n deleted\n saved\n new // hidden from stateName\n uncommitted\n invalid\n inFlight\n\n @internal\n*/\nclass RecordState {\n constructor(record) {\n const store = storeFor$1(record);\n const identity = recordIdentifierFor(record);\n this.identifier = identity;\n this.record = record;\n this.cache = store.cache;\n this.pendingCount = 0;\n this.fulfilledCount = 0;\n this.rejectedCount = 0;\n this._errorRequests = [];\n this._lastError = null;\n const requests = store.getRequestStateService();\n const notifications = store.notifications;\n const handleRequest = req => {\n if (req.type === 'mutation') {\n switch (req.state) {\n case 'pending':\n this.isSaving = true;\n break;\n case 'rejected':\n this.isSaving = false;\n this._lastError = req;\n if (!(req.response && isInvalidError(req.response.data))) {\n this._errorRequests.push(req);\n }\n notifyErrorsStateChanged(this);\n break;\n case 'fulfilled':\n this._errorRequests = [];\n this._lastError = null;\n this.isSaving = false;\n this.notify('isDirty');\n notifyErrorsStateChanged(this);\n break;\n }\n } else {\n switch (req.state) {\n case 'pending':\n this.pendingCount++;\n this.notify('isLoading');\n break;\n case 'rejected':\n this.pendingCount--;\n this._lastError = req;\n if (!(req.response && isInvalidError(req.response.data))) {\n this._errorRequests.push(req);\n }\n this.notify('isLoading');\n notifyErrorsStateChanged(this);\n break;\n case 'fulfilled':\n this.pendingCount--;\n this.fulfilledCount++;\n this.notify('isLoading');\n this.notify('isDirty');\n notifyErrorsStateChanged(this);\n this._errorRequests = [];\n this._lastError = null;\n break;\n }\n }\n };\n requests.subscribeForRecord(identity, handleRequest);\n\n // we instantiate lazily\n // so we grab anything we don't have yet\n const lastRequest = requests.getLastRequestForRecord(identity);\n if (lastRequest) {\n handleRequest(lastRequest);\n }\n this.handler = notifications.subscribe(identity, (identifier, type, key) => {\n switch (type) {\n case 'state':\n this.notify('isSaved');\n this.notify('isNew');\n this.notify('isDeleted');\n this.notify('isDirty');\n break;\n case 'attributes':\n this.notify('isEmpty');\n this.notify('isDirty');\n break;\n case 'errors':\n this.updateInvalidErrors(this.record.errors);\n this.notify('isValid');\n break;\n }\n });\n }\n destroy() {\n storeFor$1(this.record).notifications.unsubscribe(this.handler);\n }\n notify(key) {\n notifySignal(this, key);\n }\n updateInvalidErrors(errors) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected the Cache instance for ${this.identifier.lid} to implement getErrors(identifier)`);\n }\n })(typeof this.cache.getErrors === 'function') : {};\n const jsonApiErrors = this.cache.getErrors(this.identifier);\n errors.clear();\n for (let i = 0; i < jsonApiErrors.length; i++) {\n const error = jsonApiErrors[i];\n if (error.source && error.source.pointer) {\n const keyMatch = error.source.pointer.match(SOURCE_POINTER_REGEXP);\n let key;\n if (keyMatch) {\n key = keyMatch[2];\n } else if (error.source.pointer.search(SOURCE_POINTER_PRIMARY_REGEXP) !== -1) {\n key = PRIMARY_ATTRIBUTE_KEY;\n }\n if (key) {\n const errMsg = error.detail || error.title;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected field error to have a detail or title to use as the message`);\n }\n })(errMsg) : {};\n errors.add(key, errMsg);\n }\n }\n }\n }\n cleanErrorRequests() {\n this.notify('isValid');\n this.notify('isError');\n this.notify('adapterError');\n this._errorRequests = [];\n this._lastError = null;\n }\n get isLoading() {\n return !this.isLoaded && this.pendingCount > 0 && this.fulfilledCount === 0;\n }\n static {\n decorateMethodV2(this.prototype, \"isLoading\", [tagged]);\n }\n get isLoaded() {\n if (this.isNew) {\n return true;\n }\n return this.fulfilledCount > 0 || !this.isEmpty;\n }\n static {\n decorateMethodV2(this.prototype, \"isLoaded\", [tagged]);\n }\n get isSaved() {\n const rd = this.cache;\n if (this.isDeleted) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected Cache to implement isDeletionCommitted()`);\n }\n })(typeof rd.isDeletionCommitted === 'function') : {};\n return rd.isDeletionCommitted(this.identifier);\n }\n if (this.isNew || this.isEmpty || !this.isValid || this.isDirty || this.isLoading) {\n return false;\n }\n return true;\n }\n static {\n decorateMethodV2(this.prototype, \"isSaved\", [tagged]);\n }\n get isEmpty() {\n const rd = this.cache;\n // TODO this is not actually an RFC'd concept. Determine the\n // correct heuristic to replace this with.\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected Cache to implement isEmpty()`);\n }\n })(typeof rd.isEmpty === 'function') : {};\n return !this.isNew && rd.isEmpty(this.identifier);\n }\n static {\n decorateMethodV2(this.prototype, \"isEmpty\", [tagged]);\n }\n get isNew() {\n const rd = this.cache;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected Cache to implement isNew()`);\n }\n })(typeof rd.isNew === 'function') : {};\n return rd.isNew(this.identifier);\n }\n static {\n decorateMethodV2(this.prototype, \"isNew\", [tagged]);\n }\n get isDeleted() {\n const rd = this.cache;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected Cache to implement isDeleted()`);\n }\n })(typeof rd.isDeleted === 'function') : {};\n return rd.isDeleted(this.identifier);\n }\n static {\n decorateMethodV2(this.prototype, \"isDeleted\", [tagged]);\n }\n get isValid() {\n return this.record.errors.length === 0;\n }\n static {\n decorateMethodV2(this.prototype, \"isValid\", [tagged]);\n }\n get isDirty() {\n const rd = this.cache;\n if (this.isEmpty || rd.isDeletionCommitted(this.identifier) || this.isDeleted && this.isNew) {\n return false;\n }\n return this.isDeleted || this.isNew || rd.hasChangedAttrs(this.identifier);\n }\n static {\n decorateMethodV2(this.prototype, \"isDirty\", [tagged]);\n }\n get isError() {\n const errorReq = this._errorRequests[this._errorRequests.length - 1];\n if (!errorReq) {\n return false;\n } else {\n return true;\n }\n }\n static {\n decorateMethodV2(this.prototype, \"isError\", [tagged]);\n }\n get adapterError() {\n const request = this._lastError;\n if (!request) {\n return null;\n }\n return request.state === 'rejected' && request.response.data;\n }\n static {\n decorateMethodV2(this.prototype, \"adapterError\", [tagged]);\n }\n get isPreloaded() {\n return !this.isEmpty && this.isLoading;\n }\n static {\n decorateMethodV2(this.prototype, \"isPreloaded\", [cached]);\n }\n get stateName() {\n // we might be empty while loading so check this first\n if (this.isLoading) {\n return 'root.loading';\n\n // got nothing yet or were unloaded\n } else if (this.isEmpty) {\n return 'root.empty';\n\n // deleted substates\n } else if (this.isDeleted) {\n if (this.isSaving) {\n return 'root.deleted.inFlight';\n } else if (this.isSaved) {\n // TODO ensure isSaved isn't true from previous requests\n return 'root.deleted.saved';\n } else if (!this.isValid) {\n return 'root.deleted.invalid';\n } else {\n return 'root.deleted.uncommitted';\n }\n\n // loaded.created substates\n } else if (this.isNew) {\n if (this.isSaving) {\n return 'root.loaded.created.inFlight';\n } else if (!this.isValid) {\n return 'root.loaded.created.invalid';\n }\n return 'root.loaded.created.uncommitted';\n\n // loaded.updated substates\n } else if (this.isSaving) {\n return 'root.loaded.updated.inFlight';\n } else if (!this.isValid) {\n return 'root.loaded.updated.invalid';\n } else if (this.isDirty) {\n return 'root.loaded.updated.uncommitted';\n\n // if nothing remains, we are loaded saved!\n } else {\n return 'root.loaded.saved';\n }\n }\n static {\n decorateMethodV2(this.prototype, \"stateName\", [cached]);\n }\n get dirtyType() {\n // we might be empty while loading so check this first\n if (this.isLoading || this.isEmpty) {\n return '';\n\n // deleted substates\n } else if (this.isDirty && this.isDeleted) {\n return 'deleted';\n\n // loaded.created substates\n } else if (this.isNew) {\n return 'created';\n\n // loaded.updated substates\n } else if (this.isSaving || !this.isValid || this.isDirty) {\n return 'updated';\n\n // if nothing remains, we are loaded saved!\n } else {\n return '';\n }\n }\n static {\n decorateMethodV2(this.prototype, \"dirtyType\", [cached]);\n }\n}\ndefineSignal(RecordState.prototype, 'isSaving', false);\nfunction notifyErrorsStateChanged(state) {\n state.notify('isValid');\n state.notify('isError');\n state.notify('adapterError');\n}\n\n/**\n @module @ember-data/model\n */\n\n/*\n * This decorator allows us to lazily compute\n * an expensive getter on first-access and thereafter\n * never recompute it.\n */\nfunction computeOnce(target, propertyName, desc) {\n const cache = new WeakMap();\n // eslint-disable-next-line @typescript-eslint/unbound-method\n const getter = desc.get;\n desc.get = function () {\n let meta = cache.get(this);\n if (!meta) {\n meta = {\n hasComputed: false,\n value: undefined\n };\n cache.set(this, meta);\n }\n if (!meta.hasComputed) {\n meta.value = getter.call(this);\n meta.hasComputed = true;\n }\n return meta.value;\n };\n return desc;\n}\n\n/**\n Base class from which Models can be defined.\n\n ```js\n import Model, { attr } from '@ember-data/model';\n\n export default class User extends Model {\n @attr name;\n }\n ```\n\n Models are used both to define the static schema for a\n particular resource type as well as the class to instantiate\n to present that data from cache.\n\n @class Model\n @public\n @extends Ember.EmberObject\n*/\n\nclass Model extends EmberObject {\n // set during create by the store\n\n init(options) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (!options?._secretInit && !options?._createProps) {\n throw new Error('You should not call `create` on a model. Instead, call `store.createRecord` with the attributes you would like to set.');\n }\n }\n const createProps = options._createProps;\n const _secretInit = options._secretInit;\n options._createProps = null;\n options._secretInit = null;\n const store = this.store = _secretInit.store;\n super.init(options);\n this[RecordStore] = store;\n const identity = _secretInit.identifier;\n _secretInit.cb(this, _secretInit.cache, identity, _secretInit.store);\n this.___recordState = macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? new RecordState(this) : null;\n this.setProperties(createProps);\n const notifications = store.notifications;\n this.___private_notifications = notifications.subscribe(identity, (identifier, type, field) => {\n notifyChanges(identifier, type, field, this, store);\n });\n }\n\n // @ts-expect-error destroy should not return a value, but ember's types force it to\n destroy() {\n const identifier = recordIdentifierFor$1(this);\n this.___recordState?.destroy();\n const store = storeFor$1(this);\n store.notifications.unsubscribe(this.___private_notifications);\n // Legacy behavior is to notify the relationships on destroy\n // such that they \"clear\". It's uncertain this behavior would\n // be good for a new model paradigm, likely cheaper and safer\n // to simply not notify, for this reason the store does not itself\n // notify individual changes once the delete has been signaled,\n // this decision is left to model instances.\n\n this.eachRelationship((name, meta) => {\n if (meta.kind === 'belongsTo') {\n this.notifyPropertyChange(name);\n }\n });\n LEGACY_SUPPORT.get(this)?.destroy();\n LEGACY_SUPPORT.delete(this);\n LEGACY_SUPPORT.delete(identifier);\n super.destroy();\n }\n\n /**\n If this property is `true` the record is in the `empty`\n state. Empty is the first state all records enter after they have\n been created. Most records created by the store will quickly\n transition to the `loading` state if data needs to be fetched from\n the server or the `created` state if the record is created on the\n client. A record can also enter the empty state if the adapter is\n unable to locate the record.\n @property isEmpty\n @public\n @type {Boolean}\n @readOnly\n */\n get isEmpty() {\n return this.currentState.isEmpty;\n }\n\n /**\n If this property is `true` the record is in the `loading` state. A\n record enters this state when the store asks the adapter for its\n data. It remains in this state until the adapter provides the\n requested data.\n @property isLoading\n @public\n @type {Boolean}\n @readOnly\n */\n static {\n decorateMethodV2(this.prototype, \"isEmpty\", [compat]);\n }\n get isLoading() {\n return this.currentState.isLoading;\n }\n\n /**\n If this property is `true` the record is in the `loaded` state. A\n record enters this state when its data is populated. Most of a\n record's lifecycle is spent inside substates of the `loaded`\n state.\n Example\n ```javascript\n let record = store.createRecord('model');\n record.isLoaded; // true\n store.findRecord('model', 1).then(function(model) {\n model.isLoaded; // true\n });\n ```\n @property isLoaded\n @public\n @type {Boolean}\n @readOnly\n */\n static {\n decorateMethodV2(this.prototype, \"isLoading\", [compat]);\n }\n get isLoaded() {\n return this.currentState.isLoaded;\n }\n\n /**\n If this property is `true` the record is in the `dirty` state. The\n record has local changes that have not yet been saved by the\n adapter. This includes records that have been created (but not yet\n saved) or deleted.\n Example\n ```javascript\n let record = store.createRecord('model');\n record.hasDirtyAttributes; // true\n store.findRecord('model', 1).then(function(model) {\n model.hasDirtyAttributes; // false\n model.set('foo', 'some value');\n model.hasDirtyAttributes; // true\n });\n ```\n @since 1.13.0\n @property hasDirtyAttributes\n @public\n @type {Boolean}\n @readOnly\n */\n static {\n decorateMethodV2(this.prototype, \"isLoaded\", [compat]);\n }\n get hasDirtyAttributes() {\n return this.currentState.isDirty;\n }\n\n /**\n If this property is `true` the record is in the `saving` state. A\n record enters the saving state when `save` is called, but the\n adapter has not yet acknowledged that the changes have been\n persisted to the backend.\n Example\n ```javascript\n let record = store.createRecord('model');\n record.isSaving; // false\n let promise = record.save();\n record.isSaving; // true\n promise.then(function() {\n record.isSaving; // false\n });\n ```\n @property isSaving\n @public\n @type {Boolean}\n @readOnly\n */\n static {\n decorateMethodV2(this.prototype, \"hasDirtyAttributes\", [compat]);\n }\n get isSaving() {\n return this.currentState.isSaving;\n }\n\n /**\n If this property is `true` the record is in the `deleted` state\n and has been marked for deletion. When `isDeleted` is true and\n `hasDirtyAttributes` is true, the record is deleted locally but the deletion\n was not yet persisted. When `isSaving` is true, the change is\n in-flight. When both `hasDirtyAttributes` and `isSaving` are false, the\n change has persisted.\n Example\n ```javascript\n let record = store.createRecord('model');\n record.isDeleted; // false\n record.deleteRecord();\n // Locally deleted\n record.isDeleted; // true\n record.hasDirtyAttributes; // true\n record.isSaving; // false\n // Persisting the deletion\n let promise = record.save();\n record.isDeleted; // true\n record.isSaving; // true\n // Deletion Persisted\n promise.then(function() {\n record.isDeleted; // true\n record.isSaving; // false\n record.hasDirtyAttributes; // false\n });\n ```\n @property isDeleted\n @public\n @type {Boolean}\n @readOnly\n */\n static {\n decorateMethodV2(this.prototype, \"isSaving\", [compat]);\n }\n get isDeleted() {\n return this.currentState.isDeleted;\n }\n\n /**\n If this property is `true` the record is in the `new` state. A\n record will be in the `new` state when it has been created on the\n client and the adapter has not yet report that it was successfully\n saved.\n Example\n ```javascript\n let record = store.createRecord('model');\n record.isNew; // true\n record.save().then(function(model) {\n model.isNew; // false\n });\n ```\n @property isNew\n @public\n @type {Boolean}\n @readOnly\n */\n static {\n decorateMethodV2(this.prototype, \"isDeleted\", [compat]);\n }\n get isNew() {\n return this.currentState.isNew;\n }\n\n /**\n If this property is `true` the record is in the `valid` state.\n A record will be in the `valid` state when the adapter did not report any\n server-side validation failures.\n @property isValid\n @public\n @type {Boolean}\n @readOnly\n */\n static {\n decorateMethodV2(this.prototype, \"isNew\", [compat]);\n }\n get isValid() {\n return this.currentState.isValid;\n }\n\n /**\n If the record is in the dirty state this property will report what\n kind of change has caused it to move into the dirty\n state. Possible values are:\n - `created` The record has been created by the client and not yet saved to the adapter.\n - `updated` The record has been updated by the client and not yet saved to the adapter.\n - `deleted` The record has been deleted by the client and not yet saved to the adapter.\n Example\n ```javascript\n let record = store.createRecord('model');\n record.dirtyType; // 'created'\n ```\n @property dirtyType\n @public\n @type {String}\n @readOnly\n */\n static {\n decorateMethodV2(this.prototype, \"isValid\", [compat]);\n }\n get dirtyType() {\n return this.currentState.dirtyType;\n }\n\n /**\n If `true` the adapter reported that it was unable to save local\n changes to the backend for any reason other than a server-side\n validation error.\n Example\n ```javascript\n record.isError; // false\n record.set('foo', 'valid value');\n record.save().then(null, function() {\n record.isError; // true\n });\n ```\n @property isError\n @public\n @type {Boolean}\n @readOnly\n */\n static {\n decorateMethodV2(this.prototype, \"dirtyType\", [compat]);\n }\n get isError() {\n return this.currentState.isError;\n }\n static {\n decorateMethodV2(this.prototype, \"isError\", [compat]);\n }\n set isError(v) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n throw new Error(`isError is not directly settable`);\n }\n }\n\n /**\n If `true` the store is attempting to reload the record from the adapter.\n Example\n ```javascript\n record.isReloading; // false\n record.reload();\n record.isReloading; // true\n ```\n @property isReloading\n @public\n @type {Boolean}\n @readOnly\n */\n\n /**\n All ember models have an id property. This is an identifier\n managed by an external source. These are always coerced to be\n strings before being used internally. Note when declaring the\n attributes for a model it is an error to declare an id\n attribute.\n ```javascript\n let record = store.createRecord('model');\n record.id; // null\n store.findRecord('model', 1).then(function(model) {\n model.id; // '1'\n });\n ```\n @property id\n @public\n @type {String}\n */\n get id() {\n // this guard exists, because some dev-only deprecation code\n // (addListener via validatePropertyInjections) invokes toString before the\n // object is real.\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n try {\n return recordIdentifierFor$1(this).id;\n } catch {\n return null;\n }\n }\n return recordIdentifierFor$1(this).id;\n }\n static {\n decorateMethodV2(this.prototype, \"id\", [tagged]);\n }\n set id(id) {\n const normalizedId = coerceId(id);\n const identifier = recordIdentifierFor$1(this);\n const didChange = normalizedId !== identifier.id;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot set ${identifier.type} record's id to ${id}, because id is already ${identifier.id}`);\n }\n })(!didChange || identifier.id === null) : {};\n if (normalizedId !== null && didChange) {\n this.store._instanceCache.setRecordId(identifier, normalizedId);\n this.store.notifications.notify(identifier, 'identity');\n }\n }\n toString() {\n return ``;\n }\n\n /**\n @property currentState\n @private\n @type {Object}\n */\n // TODO we can probably make this a computeOnce\n // we likely do not need to notify the currentState root anymore\n get currentState() {\n // descriptors are called with the wrong `this` context during mergeMixins\n // when using legacy/classic ember classes. Basically: lazy in prod and eager in dev.\n // so we do this to try to steer folks to the nicer \"dont user currentState\"\n // error.\n if (macroCondition(!getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (!this.___recordState) {\n this.___recordState = new RecordState(this);\n }\n }\n return this.___recordState;\n }\n static {\n decorateMethodV2(this.prototype, \"currentState\", [tagged]);\n }\n set currentState(_v) {\n throw new Error('cannot set currentState');\n }\n\n /**\n The store service instance which created this record instance\n @property store\n @public\n */\n\n /**\n When the record is in the `invalid` state this object will contain\n any errors returned by the adapter. When present the errors hash\n contains keys corresponding to the invalid property names\n and values which are arrays of Javascript objects with two keys:\n - `message` A string containing the error message from the backend\n - `attribute` The name of the property associated with this error message\n ```javascript\n record.errors.length; // 0\n record.set('foo', 'invalid value');\n record.save().catch(function() {\n record.errors.foo;\n // [{message: 'foo should be a number.', attribute: 'foo'}]\n });\n ```\n The `errors` property is useful for displaying error messages to\n the user.\n ```handlebars\n \n {{#each @model.errors.username as |error|}}\n
\n {{error.message}}\n
\n {{/each}}\n \n {{#each @model.errors.email as |error|}}\n
\n {{error.message}}\n
\n {{/each}}\n ```\n You can also access the special `messages` property on the error\n object to get an array of all the error strings.\n ```handlebars\n {{#each @model.errors.messages as |message|}}\n
\n {{message}}\n
\n {{/each}}\n ```\n @property errors\n @public\n @type {Errors}\n */\n get errors() {\n const errors = Errors.create({\n __record: this\n });\n this.currentState.updateInvalidErrors(errors);\n return errors;\n }\n\n /**\n This property holds the `AdapterError` object with which\n last adapter operation was rejected.\n @property adapterError\n @public\n @type {AdapterError}\n */\n static {\n decorateMethodV2(this.prototype, \"errors\", [computeOnce]);\n }\n get adapterError() {\n return this.currentState.adapterError;\n }\n static {\n decorateMethodV2(this.prototype, \"adapterError\", [compat]);\n }\n set adapterError(v) {\n throw new Error(`adapterError is not directly settable`);\n }\n\n /**\n Create a JSON representation of the record, using the serialization\n strategy of the store's adapter.\n `serialize` takes an optional hash as a parameter, currently\n supported options are:\n - `includeId`: `true` if the record's ID should be included in the\n JSON representation.\n @method serialize\n @public\n @param {Object} options\n @return {Object} an object whose values are primitive JSON values only\n */\n /*\n We hook the default implementation to ensure\n our tagged properties are properly notified\n as well. We still super for everything because\n sync observers require a direct call occuring\n to trigger their flush. We wouldn't need to\n super in 4.0+ where sync observers are removed.\n */\n // @ts-expect-error no return is necessary, but Ember's types are forcing it\n notifyPropertyChange(prop) {\n notifySignal(this, prop);\n super.notifyPropertyChange(prop);\n }\n\n /**\n Marks the record as deleted but does not save it. You must call\n `save` afterwards if you want to persist it. You might use this\n method if you want to allow the user to still `rollbackAttributes()`\n after a delete was made.\n Example\n ```js\n import Component from '@glimmer/component';\n export default class extends Component {\n softDelete = () => {\n this.args.model.deleteRecord();\n }\n confirm = () => {\n this.args.model.save();\n }\n undo = () => {\n this.args.model.rollbackAttributes();\n }\n }\n ```\n @method deleteRecord\n @public\n */\n\n /**\n Same as `deleteRecord`, but saves the record immediately.\n Example\n ```js\n import Component from '@glimmer/component';\n export default class extends Component {\n delete = () => {\n this.args.model.destroyRecord().then(function() {\n this.transitionToRoute('model.index');\n });\n }\n }\n ```\n If you pass an object on the `adapterOptions` property of the options\n argument it will be passed to your adapter via the snapshot\n ```js\n record.destroyRecord({ adapterOptions: { subscribe: false } });\n ```\n ```app/adapters/post.js\n import MyCustomAdapter from './custom-adapter';\n export default class PostAdapter extends MyCustomAdapter {\n deleteRecord(store, type, snapshot) {\n if (snapshot.adapterOptions.subscribe) {\n // ...\n }\n // ...\n }\n }\n ```\n @method destroyRecord\n @public\n @param {Object} options\n @return {Promise} a promise that will be resolved when the adapter returns\n successfully or rejected if the adapter returns with an error.\n */\n\n /**\n Unloads the record from the store. This will not send a delete request\n to your server, it just unloads the record from memory.\n @method unloadRecord\n @public\n */\n\n /**\n Returns an object, whose keys are changed properties, and value is\n an [oldProp, newProp] array.\n The array represents the diff of the canonical state with the local state\n of the model. Note: if the model is created locally, the canonical state is\n empty since the adapter hasn't acknowledged the attributes yet:\n Example\n ```app/models/mascot.js\n import Model, { attr } from '@ember-data/model';\n export default class MascotModel extends Model {\n @attr('string') name;\n @attr('boolean', {\n defaultValue: false\n })\n isAdmin;\n }\n ```\n ```javascript\n let mascot = store.createRecord('mascot');\n mascot.changedAttributes(); // {}\n mascot.set('name', 'Tomster');\n mascot.changedAttributes(); // { name: [undefined, 'Tomster'] }\n mascot.set('isAdmin', true);\n mascot.changedAttributes(); // { isAdmin: [undefined, true], name: [undefined, 'Tomster'] }\n mascot.save().then(function() {\n mascot.changedAttributes(); // {}\n mascot.set('isAdmin', false);\n mascot.changedAttributes(); // { isAdmin: [true, false] }\n });\n ```\n @method changedAttributes\n @public\n @return {Object} an object, whose keys are changed properties,\n and value is an [oldProp, newProp] array.\n */\n\n /**\n If the model `hasDirtyAttributes` this function will discard any unsaved\n changes. If the model `isNew` it will be removed from the store.\n Example\n ```javascript\n record.name; // 'Untitled Document'\n record.set('name', 'Doc 1');\n record.name; // 'Doc 1'\n record.rollbackAttributes();\n record.name; // 'Untitled Document'\n ```\n @since 1.13.0\n @method rollbackAttributes\n @public\n */\n\n /**\n @method _createSnapshot\n @private\n */\n // TODO @deprecate in favor of a public API or examples of how to test successfully\n\n /**\n Save the record and persist any changes to the record to an\n external source via the adapter.\n Example\n ```javascript\n record.set('name', 'Tomster');\n record.save().then(function() {\n // Success callback\n }, function() {\n // Error callback\n });\n ```\n If you pass an object using the `adapterOptions` property of the options\n argument it will be passed to your adapter via the snapshot.\n ```js\n record.save({ adapterOptions: { subscribe: false } });\n ```\n ```app/adapters/post.js\n import MyCustomAdapter from './custom-adapter';\n export default class PostAdapter extends MyCustomAdapter {\n updateRecord(store, type, snapshot) {\n if (snapshot.adapterOptions.subscribe) {\n // ...\n }\n // ...\n }\n }\n ```\n @method save\n @public\n @param {Object} options\n @return {Promise} a promise that will be resolved when the adapter returns\n successfully or rejected if the adapter returns with an error.\n */\n\n /**\n Reload the record from the adapter.\n This will only work if the record has already finished loading.\n Example\n ```js\n import Component from '@glimmer/component';\n export default class extends Component {\n async reload = () => {\n await this.args.model.reload();\n // do something with the reloaded model\n }\n }\n ```\n @method reload\n @public\n @param {Object} options optional, may include `adapterOptions` hash which will be passed to adapter request\n @return {Promise} a promise that will be resolved with the record when the\n adapter returns successfully or rejected if the adapter returns\n with an error.\n */\n\n attr() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error('The `attr` method is not available on Model, a Snapshot was probably expected. Are you passing a Model instead of a Snapshot to your serializer?');\n }\n })() : {};\n }\n\n /**\n Get the reference for the specified belongsTo relationship.\n For instance, given the following model\n ```app/models/blog-post.js\n import Model, { belongsTo } from '@ember-data/model';\n export default class BlogPost extends Model {\n @belongsTo('user', { async: true, inverse: null }) author;\n }\n ```\n Then the reference for the author relationship would be\n retrieved from a record instance like so:\n ```js\n blogPost.belongsTo('author');\n ```\n A `BelongsToReference` is a low-level API that allows access\n and manipulation of a belongsTo relationship.\n It is especially useful when you're dealing with `async` relationships\n as it allows synchronous access to the relationship data if loaded, as\n well as APIs for loading, reloading the data or accessing available\n information without triggering a load.\n It may also be useful when using `sync` relationships that need to be\n loaded/reloaded with more precise timing than marking the\n relationship as `async` and relying on autofetch would have allowed.\n However,keep in mind that marking a relationship as `async: false` will introduce\n bugs into your application if the data is not always guaranteed to be available\n by the time the relationship is accessed. Ergo, it is recommended when using this\n approach to utilize `links` for unloaded relationship state instead of identifiers.\n Reference APIs are entangled with the relationship's underlying state,\n thus any getters or cached properties that utilize these will properly\n invalidate if the relationship state changes.\n References are \"stable\", meaning that multiple calls to retrieve the reference\n for a given relationship will always return the same HasManyReference.\n @method belongsTo\n @public\n @param {String} name of the relationship\n @since 2.5.0\n @return {BelongsToReference} reference for this relationship\n */\n\n /**\n Get the reference for the specified hasMany relationship.\n For instance, given the following model\n ```app/models/blog-post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class BlogPost extends Model {\n @hasMany('comment', { async: true, inverse: null }) comments;\n }\n ```\n Then the reference for the comments relationship would be\n retrieved from a record instance like so:\n ```js\n blogPost.hasMany('comments');\n ```\n A `HasManyReference` is a low-level API that allows access\n and manipulation of a hasMany relationship.\n It is especially useful when you are dealing with `async` relationships\n as it allows synchronous access to the relationship data if loaded, as\n well as APIs for loading, reloading the data or accessing available\n information without triggering a load.\n It may also be useful when using `sync` relationships with `@ember-data/model`\n that need to be loaded/reloaded with more precise timing than marking the\n relationship as `async` and relying on autofetch would have allowed.\n However,keep in mind that marking a relationship as `async: false` will introduce\n bugs into your application if the data is not always guaranteed to be available\n by the time the relationship is accessed. Ergo, it is recommended when using this\n approach to utilize `links` for unloaded relationship state instead of identifiers.\n Reference APIs are entangled with the relationship's underlying state,\n thus any getters or cached properties that utilize these will properly\n invalidate if the relationship state changes.\n References are \"stable\", meaning that multiple calls to retrieve the reference\n for a given relationship will always return the same HasManyReference.\n @method hasMany\n @public\n @param {String} name of the relationship\n @since 2.5.0\n @return {HasManyReference} reference for this relationship\n */\n\n /**\n Given a callback, iterates over each of the relationships in the model,\n invoking the callback with the name of each relationship and its relationship\n descriptor.\n The callback method you provide should have the following signature (all\n parameters are optional):\n ```javascript\n function(name, descriptor);\n ```\n - `name` the name of the current property in the iteration\n - `descriptor` the meta object that describes this relationship\n The relationship descriptor argument is an object with the following properties.\n - **name** String the name of this relationship on the Model\n - **kind** String \"hasMany\" or \"belongsTo\"\n - **options** Object the original options hash passed when the relationship was declared\n - **parentType** Model the type of the Model that owns this relationship\n - **type** String the type name of the related Model\n Note that in addition to a callback, you can also pass an optional target\n object that will be set as `this` on the context.\n Example\n ```app/serializers/application.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class ApplicationSerializer extends JSONSerializer {\n serialize(record, options) {\n let json = {};\n record.eachRelationship(function(name, descriptor) {\n if (descriptor.kind === 'hasMany') {\n let serializedHasManyName = name.toUpperCase() + '_IDS';\n json[serializedHasManyName] = record.get(name).map(r => r.id);\n }\n });\n return json;\n }\n }\n ```\n @method eachRelationship\n @public\n @param {Function} callback the callback to invoke\n @param {any} binding the value to which the callback's `this` should be bound\n */\n eachRelationship(callback, binding) {\n this.constructor.eachRelationship(callback, binding);\n }\n relationshipFor(name) {\n return this.constructor.relationshipsByName.get(name);\n }\n inverseFor(name) {\n return this.constructor.inverseFor(name, storeFor$1(this));\n }\n eachAttribute(callback, binding) {\n this.constructor.eachAttribute(callback, binding);\n }\n static isModel = true;\n\n /**\n Create should only ever be called by the store. To create an instance of a\n `Model` in a dirty state use `store.createRecord`.\n To create instances of `Model` in a clean state, use `store.push`\n @method create\n @private\n @static\n */\n\n /**\n Represents the model's class name as a string. This can be used to look up the model's class name through\n `Store`'s modelFor method.\n `modelName` is generated for you by EmberData. It will be a lowercased, dasherized string.\n For example:\n ```javascript\n store.modelFor('post').modelName; // 'post'\n store.modelFor('blog-post').modelName; // 'blog-post'\n ```\n The most common place you'll want to access `modelName` is in your serializer's `payloadKeyFromModelName` method. For example, to change payload\n keys to underscore (instead of dasherized), you might use the following code:\n ```javascript\n import RESTSerializer from '@ember-data/serializer/rest';\n import { underscore } from '/utils/string-utils';\n export default const PostSerializer = RESTSerializer.extend({\n payloadKeyFromModelName(modelName) {\n return underscore(modelName);\n }\n });\n ```\n @property modelName\n @public\n @type String\n @readonly\n @static\n */\n static modelName = null;\n\n /*\n These class methods below provide relationship\n introspection abilities about relationships.\n A note about the computed properties contained here:\n **These properties are effectively sealed once called for the first time.**\n To avoid repeatedly doing expensive iteration over a model's fields, these\n values are computed once and then cached for the remainder of the runtime of\n your application.\n If your application needs to modify a class after its initial definition\n (for example, using `reopen()` to add additional attributes), make sure you\n do it before using your model with the store, which uses these properties\n extensively.\n */\n\n /**\n For a given relationship name, returns the model type of the relationship.\n For example, if you define a model like this:\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class PostModel extends Model {\n @hasMany('comment') comments;\n }\n ```\n Calling `store.modelFor('post').typeForRelationship('comments', store)` will return `Comment`.\n @method typeForRelationship\n @public\n @static\n @param {String} name the name of the relationship\n @param {store} store an instance of Store\n @return {Model} the type of the relationship, or undefined\n */\n static typeForRelationship(name, store) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const relationship = this.relationshipsByName.get(name);\n return relationship && store.modelFor(relationship.type);\n }\n static get inverseMap() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n return Object.create(null);\n }\n\n /**\n Find the relationship which is the inverse of the one asked for.\n For example, if you define models like this:\n ```app/models/post.js\n import Model, { hasMany } from '@ember-data/model';\n export default class PostModel extends Model {\n @hasMany('message') comments;\n }\n ```\n ```app/models/message.js\n import Model, { belongsTo } from '@ember-data/model';\n export default class MessageModel extends Model {\n @belongsTo('post') owner;\n }\n ```\n ``` js\n store.modelFor('post').inverseFor('comments', store) // { type: 'message', name: 'owner', kind: 'belongsTo' }\n store.modelFor('message').inverseFor('owner', store) // { type: 'post', name: 'comments', kind: 'hasMany' }\n ```\n @method inverseFor\n @public\n @static\n @param {String} name the name of the relationship\n @param {Store} store\n @return {Object} the inverse relationship, or null\n */\n static {\n decorateMethodV2(this, \"inverseMap\", [computeOnce]);\n }\n static inverseFor(name, store) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const inverseMap = this.inverseMap;\n if (inverseMap[name]) {\n return inverseMap[name];\n } else {\n const inverse = this._findInverseFor(name, store);\n inverseMap[name] = inverse;\n return inverse;\n }\n }\n\n //Calculate the inverse, ignoring the cache\n static _findInverseFor(name, store) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const relationship = this.relationshipsByName.get(name);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`No relationship named '${name}' on '${this.modelName}' exists.`);\n }\n })(relationship) : {};\n if (!relationship) {\n return null;\n }\n const {\n options\n } = relationship;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected the relationship ${name} on ${this.modelName} to define an inverse.`);\n }\n })(options.inverse === null || typeof options.inverse === 'string' && options.inverse.length > 0) : {};\n if (options.inverse === null) {\n return null;\n }\n const schemaExists = store.schema.hasResource(relationship);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`No associated schema found for '${relationship.type}' while calculating the inverse of ${name} on ${this.modelName}`);\n }\n })(schemaExists) : {};\n if (!schemaExists) {\n return null;\n }\n const inverseField = store.schema.fields(relationship).get(options.inverse);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`No inverse relationship found for '${name}' on '${this.modelName}'`);\n }\n })(inverseField && (inverseField.kind === 'belongsTo' || inverseField.kind === 'hasMany')) : {};\n return inverseField || null;\n }\n\n /**\n The model's relationships as a map, keyed on the type of the\n relationship. The value of each entry is an array containing a descriptor\n for each relationship with that type, describing the name of the relationship\n as well as the type.\n For example, given the following model definition:\n ```app/models/blog.js\n import Model, { belongsTo, hasMany } from '@ember-data/model';\n export default class BlogModel extends Model {\n @hasMany('user') users;\n @belongsTo('user') owner;\n @hasMany('post') posts;\n }\n ```\n This computed property would return a map describing these\n relationships, like this:\n ```javascript\n import Blog from 'app/models/blog';\n import User from 'app/models/user';\n import Post from 'app/models/post';\n let relationships = Blog.relationships;\n relationships.user;\n //=> [ { name: 'users', kind: 'hasMany' },\n // { name: 'owner', kind: 'belongsTo' } ]\n relationships.post;\n //=> [ { name: 'posts', kind: 'hasMany' } ]\n ```\n @property relationships\n @public\n @static\n @type Map\n @readOnly\n */\n\n static get relationships() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const map = new Map();\n const relationshipsByName = this.relationshipsByName;\n\n // Loop through each computed property on the class\n relationshipsByName.forEach(desc => {\n const {\n type\n } = desc;\n if (!map.has(type)) {\n map.set(type, []);\n }\n map.get(type).push(desc);\n });\n return map;\n }\n\n /**\n A hash containing lists of the model's relationships, grouped\n by the relationship kind. For example, given a model with this\n definition:\n ```app/models/blog.js\n import Model, { belongsTo, hasMany } from '@ember-data/model';\n export default class BlogModel extends Model {\n @hasMany('user') users;\n @belongsTo('user') owner;\n @hasMany('post') posts;\n }\n ```\n This property would contain the following:\n ```javascript\n import Blog from 'app/models/blog';\n let relationshipNames = Blog.relationshipNames;\n relationshipNames.hasMany;\n //=> ['users', 'posts']\n relationshipNames.belongsTo;\n //=> ['owner']\n ```\n @property relationshipNames\n @public\n @static\n @type Object\n @readOnly\n */\n static {\n decorateMethodV2(this, \"relationships\", [computeOnce]);\n }\n static get relationshipNames() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const names = {\n hasMany: [],\n belongsTo: []\n };\n this.eachComputedProperty((name, meta) => {\n if (isRelationshipSchema(meta)) {\n names[meta.kind].push(name);\n }\n });\n return names;\n }\n\n /**\n An array of types directly related to a model. Each type will be\n included once, regardless of the number of relationships it has with\n the model.\n For example, given a model with this definition:\n ```app/models/blog.js\n import Model, { belongsTo, hasMany } from '@ember-data/model';\n export default class BlogModel extends Model {\n @hasMany('user') users;\n @belongsTo('user') owner;\n @hasMany('post') posts;\n }\n ```\n This property would contain the following:\n ```javascript\n import Blog from 'app/models/blog';\n let relatedTypes = Blog.relatedTypes');\n //=> ['user', 'post']\n ```\n @property relatedTypes\n @public\n @static\n @type Array\n @readOnly\n */\n static {\n decorateMethodV2(this, \"relationshipNames\", [computeOnce]);\n }\n static get relatedTypes() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const types = [];\n const rels = this.relationshipsObject;\n const relationships = Object.keys(rels);\n\n // create an array of the unique types involved\n // in relationships\n for (let i = 0; i < relationships.length; i++) {\n const name = relationships[i];\n const meta = rels[name];\n const modelName = meta.type;\n if (!types.includes(modelName)) {\n types.push(modelName);\n }\n }\n return types;\n }\n\n /**\n A map whose keys are the relationships of a model and whose values are\n relationship descriptors.\n For example, given a model with this\n definition:\n ```app/models/blog.js\n import Model, { belongsTo, hasMany } from '@ember-data/model';\n export default class BlogModel extends Model {\n @hasMany('user') users;\n @belongsTo('user') owner;\n @hasMany('post') posts;\n }\n ```\n This property would contain the following:\n ```javascript\n import Blog from 'app/models/blog';\n let relationshipsByName = Blog.relationshipsByName;\n relationshipsByName.users;\n //=> { name: 'users', kind: 'hasMany', type: 'user', options: Object }\n relationshipsByName.owner;\n //=> { name: 'owner', kind: 'belongsTo', type: 'user', options: Object }\n ```\n @property relationshipsByName\n @public\n @static\n @type Map\n @readOnly\n */\n static {\n decorateMethodV2(this, \"relatedTypes\", [computeOnce]);\n }\n static get relationshipsByName() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const map = new Map();\n const rels = this.relationshipsObject;\n const relationships = Object.keys(rels);\n for (let i = 0; i < relationships.length; i++) {\n const name = relationships[i];\n const value = rels[name];\n map.set(value.name, value);\n }\n return map;\n }\n static {\n decorateMethodV2(this, \"relationshipsByName\", [computeOnce]);\n }\n static get relationshipsObject() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const relationships = Object.create(null);\n const modelName = this.modelName;\n this.eachComputedProperty((name, meta) => {\n if (!isRelationshipSchema(meta)) {\n return;\n }\n // TODO deprecate key being here\n meta.key = name;\n meta.name = name;\n relationships[name] = meta;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected options in meta`);\n }\n })(meta.options && typeof meta.options === 'object') : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You should not specify both options.as and options.inverse as null on ${modelName}.${meta.name}, as if there is no inverse field there is no abstract type to conform to. You may have intended for this relationship to be polymorphic, or you may have mistakenly set inverse to null.`);\n }\n })(!(meta.options.inverse === null && meta.options.as?.length)) : {};\n });\n return relationships;\n }\n\n /**\n A map whose keys are the fields of the model and whose values are strings\n describing the kind of the field. A model's fields are the union of all of its\n attributes and relationships.\n For example:\n ```app/models/blog.js\n import Model, { attr, belongsTo, hasMany } from '@ember-data/model';\n export default class BlogModel extends Model {\n @hasMany('user') users;\n @belongsTo('user') owner;\n @hasMany('post') posts;\n @attr('string') title;\n }\n ```\n ```js\n import Blog from 'app/models/blog'\n let fields = Blog.fields;\n fields.forEach(function(kind, field) {\n // do thing\n });\n // prints:\n // users, hasMany\n // owner, belongsTo\n // posts, hasMany\n // title, attribute\n ```\n @property fields\n @public\n @static\n @type Map\n @readOnly\n */\n static {\n decorateMethodV2(this, \"relationshipsObject\", [computeOnce]);\n }\n static get fields() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const map = new Map();\n this.eachComputedProperty((name, meta) => {\n if (isRelationshipSchema(meta)) {\n map.set(name, meta.kind);\n } else if (isAttributeSchema(meta)) {\n map.set(name, 'attribute');\n }\n });\n return map;\n }\n\n /**\n Given a callback, iterates over each of the relationships in the model,\n invoking the callback with the name of each relationship and its relationship\n descriptor.\n @method eachRelationship\n @public\n @static\n @param {Function} callback the callback to invoke\n @param {any} binding the value to which the callback's `this` should be bound\n */\n static {\n decorateMethodV2(this, \"fields\", [computeOnce]);\n }\n static eachRelationship(callback, binding) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n this.relationshipsByName.forEach((relationship, name) => {\n callback.call(binding, name, relationship);\n });\n }\n\n /**\n Given a callback, iterates over each of the types related to a model,\n invoking the callback with the related type's class. Each type will be\n returned just once, regardless of how many different relationships it has\n with a model.\n @method eachRelatedType\n @public\n @static\n @param {Function} callback the callback to invoke\n @param {any} binding the value to which the callback's `this` should be bound\n */\n static eachRelatedType(callback, binding) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const relationshipTypes = this.relatedTypes;\n for (let i = 0; i < relationshipTypes.length; i++) {\n const type = relationshipTypes[i];\n callback.call(binding, type);\n }\n }\n\n /**\n *\n * @method determineRelationshipType\n * @private\n * @deprecated\n */\n static determineRelationshipType(knownSide, store) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const knownKey = knownSide.name;\n const knownKind = knownSide.kind;\n const inverse = this.inverseFor(knownKey, store);\n // let key;\n\n if (!inverse) {\n return knownKind === 'belongsTo' ? 'oneToNone' : 'manyToNone';\n }\n\n // key = inverse.name;\n const otherKind = inverse.kind;\n if (otherKind === 'belongsTo') {\n return knownKind === 'belongsTo' ? 'oneToOne' : 'manyToOne';\n } else {\n return knownKind === 'belongsTo' ? 'oneToMany' : 'manyToMany';\n }\n }\n\n /**\n A map whose keys are the attributes of the model (properties\n described by attr) and whose values are the meta object for the\n property.\n Example\n ```app/models/person.js\n import Model, { attr } from '@ember-data/model';\n export default class PersonModel extends Model {\n @attr('string') firstName;\n @attr('string') lastName;\n @attr('date') birthday;\n }\n ```\n ```javascript\n import Person from 'app/models/person'\n let attributes = Person.attributes\n attributes.forEach(function(meta, name) {\n // do thing\n });\n // prints:\n // firstName {type: \"string\", kind: 'attribute', options: Object, parentType: function, name: \"firstName\"}\n // lastName {type: \"string\", kind: 'attribute', options: Object, parentType: function, name: \"lastName\"}\n // birthday {type: \"date\", kind: 'attribute', options: Object, parentType: function, name: \"birthday\"}\n ```\n @property attributes\n @public\n @static\n @type {Map}\n @readOnly\n */\n static get attributes() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const map = new Map();\n this.eachComputedProperty((name, meta) => {\n if (isAttributeSchema(meta)) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(\"You may not set `id` as an attribute on your model. Please remove any lines that look like: `id: attr('')` from \" + this.toString());\n }\n })(name !== 'id') : {};\n\n // TODO deprecate key being here\n meta.key = name;\n meta.name = name;\n map.set(name, meta);\n }\n });\n return map;\n }\n\n /**\n A map whose keys are the attributes of the model (properties\n described by attr) and whose values are type of transformation\n applied to each attribute. This map does not include any\n attributes that do not have an transformation type.\n Example\n ```app/models/person.js\n import Model, { attr } from '@ember-data/model';\n export default class PersonModel extends Model {\n @attr firstName;\n @attr('string') lastName;\n @attr('date') birthday;\n }\n ```\n ```javascript\n import Person from 'app/models/person';\n let transformedAttributes = Person.transformedAttributes\n transformedAttributes.forEach(function(field, type) {\n // do thing\n });\n // prints:\n // lastName string\n // birthday date\n ```\n @property transformedAttributes\n @public\n @static\n @type {Map}\n @readOnly\n */\n static {\n decorateMethodV2(this, \"attributes\", [computeOnce]);\n }\n static get transformedAttributes() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n const map = new Map();\n this.eachAttribute((name, meta) => {\n if (meta.type) {\n map.set(name, meta.type);\n }\n });\n return map;\n }\n\n /**\n Iterates through the attributes of the model, calling the passed function on each\n attribute.\n The callback method you provide should have the following signature (all\n parameters are optional):\n ```javascript\n function(name, meta);\n ```\n - `name` the name of the current property in the iteration\n - `meta` the meta object for the attribute property in the iteration\n Note that in addition to a callback, you can also pass an optional target\n object that will be set as `this` on the context.\n Example\n ```javascript\n import Model, { attr } from '@ember-data/model';\n class PersonModel extends Model {\n @attr('string') firstName;\n @attr('string') lastName;\n @attr('date') birthday;\n }\n PersonModel.eachAttribute(function(name, meta) {\n // do thing\n });\n // prints:\n // firstName {type: \"string\", kind: 'attribute', options: Object, parentType: function, name: \"firstName\"}\n // lastName {type: \"string\", kind: 'attribute', options: Object, parentType: function, name: \"lastName\"}\n // birthday {type: \"date\", kind: 'attribute', options: Object, parentType: function, name: \"birthday\"}\n ```\n @method eachAttribute\n @public\n @param {Function} callback The callback to execute\n @param {Object} [binding] the value to which the callback's `this` should be bound\n @static\n */\n static {\n decorateMethodV2(this, \"transformedAttributes\", [computeOnce]);\n }\n static eachAttribute(callback, binding) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n this.attributes.forEach((meta, name) => {\n callback.call(binding, name, meta);\n });\n }\n\n /**\n Iterates through the transformedAttributes of the model, calling\n the passed function on each attribute. Note the callback will not be\n called for any attributes that do not have an transformation type.\n The callback method you provide should have the following signature (all\n parameters are optional):\n ```javascript\n function(name, type);\n ```\n - `name` the name of the current property in the iteration\n - `type` a string containing the name of the type of transformed\n applied to the attribute\n Note that in addition to a callback, you can also pass an optional target\n object that will be set as `this` on the context.\n Example\n ```javascript\n import Model, { attr } from '@ember-data/model';\n let Person = Model.extend({\n firstName: attr(),\n lastName: attr('string'),\n birthday: attr('date')\n });\n Person.eachTransformedAttribute(function(name, type) {\n // do thing\n });\n // prints:\n // lastName string\n // birthday date\n ```\n @method eachTransformedAttribute\n @public\n @param {Function} callback The callback to execute\n @param {Object} [binding] the value to which the callback's `this` should be bound\n @static\n */\n static eachTransformedAttribute(callback, binding) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n this.transformedAttributes.forEach((type, name) => {\n callback.call(binding, name, type);\n });\n }\n\n /**\n Returns the name of the model class.\n @method toString\n @public\n @static\n */\n static toString() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Accessing schema information on Models without looking up the model via the store is disallowed.`);\n }\n })(this.modelName) : {};\n return `model:${this.modelName}`;\n }\n}\n\n// @ts-expect-error TS doesn't know how to do `this` function overloads\nModel.prototype.save = save;\n// @ts-expect-error TS doesn't know how to do `this` function overloads\nModel.prototype.destroyRecord = destroyRecord;\nModel.prototype.unloadRecord = unloadRecord;\nModel.prototype.hasMany = hasMany;\nModel.prototype.belongsTo = belongsTo;\nModel.prototype.serialize = serialize;\nModel.prototype._createSnapshot = createSnapshot;\nModel.prototype.deleteRecord = deleteRecord;\nModel.prototype.changedAttributes = changedAttributes;\nModel.prototype.rollbackAttributes = rollbackAttributes;\nModel.prototype.reload = reload;\ndefineSignal(Model.prototype, 'isReloading', false);\n\n// this is required to prevent `init` from passing\n// the values initialized during create to `setUnknownProperty`\nModel.prototype._createProps = null;\nModel.prototype._secretInit = null;\nif (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n const lookupDescriptor = function lookupDescriptor(obj, keyName) {\n let current = obj;\n do {\n const descriptor = Object.getOwnPropertyDescriptor(current, keyName);\n if (descriptor !== undefined) {\n return descriptor;\n }\n current = Object.getPrototypeOf(current);\n } while (current !== null);\n return null;\n };\n\n // eslint-disable-next-line @typescript-eslint/unbound-method\n const init = Model.prototype.init;\n Model.prototype.init = function (createArgs) {\n init.call(this, createArgs);\n const ourDescriptor = lookupDescriptor(Model.prototype, 'currentState');\n const theirDescriptor = lookupDescriptor(this, 'currentState');\n if (!ourDescriptor || !theirDescriptor) {\n throw new Error(`Unable to determine if 'currentState' is a reserved property name on instances of classes extending Model. Please ensure that 'currentState' is not defined as a property on ${this.constructor.toString()}`);\n }\n const realState = this.___recordState;\n if (ourDescriptor.get !== theirDescriptor.get || realState !== this.currentState) {\n throw new Error(`'currentState' is a reserved property name on instances of classes extending Model. Please choose a different property name for ${this.constructor.toString()}`);\n }\n const ID_DESCRIPTOR = lookupDescriptor(Model.prototype, 'id');\n const idDesc = lookupDescriptor(this, 'id');\n if (!ID_DESCRIPTOR || !idDesc) {\n throw new Error(`Unable to determine if 'id' is a reserved property name on instances of classes extending Model. Please ensure that 'id' is not defined as a property on ${this.constructor.toString()}`);\n }\n if (idDesc.get !== ID_DESCRIPTOR.get) {\n throw new Error(`You may not set 'id' as an attribute on your model. Please remove any lines that look like: \\`id: attr('')\\` from ${this.constructor.toString()}`);\n }\n };\n delete Model.reopen;\n delete Model.reopenClass;\n}\nfunction isRelationshipSchema(meta) {\n const hasKind = typeof meta === 'object' && meta !== null && 'kind' in meta && 'options' in meta;\n return hasKind && (meta.kind === 'hasMany' || meta.kind === 'belongsTo');\n}\nfunction isAttributeSchema(meta) {\n return typeof meta === 'object' && meta !== null && 'kind' in meta && meta.kind === 'attribute';\n}\nexport { Errors as E, LEGACY_SUPPORT as L, Model as M, PromiseBelongsTo as P, RelatedCollection as R, PromiseManyArray as a, save as b, reload as c, destroyRecord as d, deleteRecord as e, RecordState as f, changedAttributes as g, hasMany as h, belongsTo as i, createSnapshot as j, isElementDescriptor as k, lookupLegacySupport as l, normalizeModelName as n, rollbackAttributes as r, serialize as s, unloadRecord as u };","import { getOwner } from '@ember/application';\nimport { deprecate } from '@ember/debug';\nimport { M as Model, n as normalizeModelName } from \"./model-BFnMMaye.js\";\nimport { macroCondition, getGlobalConfig } from '@embroider/macros';\n\n/*\n In case someone defined a relationship to a mixin, for example:\n ```ts\n class CommentModel extends Model {\n @belongsTo('commentable', { polymorphic: true }) owner;\n }\n\n let Commentable = Mixin.create({\n @hasMany('comment') comments;\n });\n ```\n we want to look up a Commentable class which has all the necessary\n relationship meta data. Thus, we look up the mixin and create a mock\n Model, so we can access the relationship CPs of the mixin (`comments`)\n in this case\n */\nfunction modelForMixin(store, normalizedModelName) {\n const owner = getOwner(store);\n const MaybeMixin = owner.factoryFor(`mixin:${normalizedModelName}`);\n const mixin = MaybeMixin && MaybeMixin.class;\n if (mixin) {\n const ModelForMixin = Model.extend(mixin);\n ModelForMixin.__isMixin = true;\n ModelForMixin.__mixin = mixin;\n //Cache the class as a model\n owner.register(`model:${normalizedModelName}`, ModelForMixin);\n }\n return owner.factoryFor(`model:${normalizedModelName}`);\n}\nclass ModelSchemaProvider {\n constructor(store) {\n this.store = store;\n this._schemas = new Map();\n this._typeMisses = new Set();\n }\n hasTrait(type) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`hasTrait is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n return false;\n }\n resourceHasTrait(resource, trait) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`resourceHasTrait is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n return false;\n }\n transformation(field) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`transformation is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n }\n derivation(field) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`derivation is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n }\n hashFn(field) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`hashFn is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n }\n resource(resource) {\n const type = normalizeModelName(resource.type);\n if (!this._schemas.has(type)) {\n this._loadModelSchema(type);\n }\n return this._schemas.get(type).schema;\n }\n registerResources(schemas) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`registerResources is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n }\n registerResource(schema) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`registerResource is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n }\n registerTransformation(transform) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`registerTransformation is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n }\n registerDerivation(derivation) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`registerDerivation is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n }\n registerHashFn(hashFn) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`registerHashFn is not available with @ember-data/model's SchemaService`);\n }\n })() : {};\n }\n _loadModelSchema(type) {\n const modelClass = this.store.modelFor(type);\n const attributeMap = modelClass.attributes;\n const attributes = Object.create(null);\n attributeMap.forEach((meta, name) => attributes[name] = meta);\n const relationships = modelClass.relationshipsObject || null;\n const fields = new Map();\n for (const attr of Object.values(attributes)) {\n fields.set(attr.name, attr);\n }\n for (const rel of Object.values(relationships)) {\n fields.set(rel.name, rel);\n }\n const schema = {\n legacy: true,\n identity: {\n name: 'id',\n kind: '@id'\n },\n type,\n fields: Array.from(fields.values())\n };\n const internalSchema = {\n schema,\n attributes,\n relationships,\n fields\n };\n this._schemas.set(type, internalSchema);\n return internalSchema;\n }\n fields(resource) {\n const type = normalizeModelName(resource.type);\n if (!this._schemas.has(type)) {\n this._loadModelSchema(type);\n }\n return this._schemas.get(type).fields;\n }\n hasResource(resource) {\n const type = normalizeModelName(resource.type);\n if (this._schemas.has(type)) {\n return true;\n }\n if (this._typeMisses.has(type)) {\n return false;\n }\n const factory = getModelFactory(this.store, type);\n const exists = factory !== null;\n if (!exists) {\n this._typeMisses.add(type);\n return false;\n }\n return true;\n }\n}\nif (macroCondition(getGlobalConfig().WarpDrive.deprecations.ENABLE_LEGACY_SCHEMA_SERVICE)) {\n ModelSchemaProvider.prototype.doesTypeExist = function (type) {\n deprecate(`Use \\`schema.hasResource({ type })\\` instead of \\`schema.doesTypeExist(type)\\``, false, {\n id: 'ember-data:schema-service-updates',\n until: '5.0',\n for: 'ember-data',\n since: {\n available: '5.4',\n enabled: '5.4'\n }\n });\n return this.hasResource({\n type\n });\n };\n ModelSchemaProvider.prototype.attributesDefinitionFor = function (resource) {\n deprecate(`Use \\`schema.fields({ type })\\` instead of \\`schema.attributesDefinitionFor({ type })\\``, false, {\n id: 'ember-data:schema-service-updates',\n until: '5.0',\n for: 'ember-data',\n since: {\n available: '5.4',\n enabled: '5.4'\n }\n });\n const type = normalizeModelName(resource.type);\n if (!this._schemas.has(type)) {\n this._loadModelSchema(type);\n }\n return this._schemas.get(type).attributes;\n };\n ModelSchemaProvider.prototype.relationshipsDefinitionFor = function (resource) {\n deprecate(`Use \\`schema.fields({ type })\\` instead of \\`schema.relationshipsDefinitionFor({ type })\\``, false, {\n id: 'ember-data:schema-service-updates',\n until: '5.0',\n for: 'ember-data',\n since: {\n available: '5.4',\n enabled: '5.4'\n }\n });\n const type = normalizeModelName(resource.type);\n if (!this._schemas.has(type)) {\n this._loadModelSchema(type);\n }\n return this._schemas.get(type).relationships;\n };\n}\nfunction buildSchema(store) {\n return new ModelSchemaProvider(store);\n}\nfunction getModelFactory(store, type) {\n if (!store._modelFactoryCache) {\n store._modelFactoryCache = Object.create(null);\n }\n const cache = store._modelFactoryCache;\n let factory = cache[type];\n if (!factory) {\n const owner = getOwner(store);\n factory = owner.factoryFor(`model:${type}`);\n if (!factory) {\n //Support looking up mixins as base types for polymorphic relationships\n factory = modelForMixin(store, type);\n }\n if (!factory) {\n // we don't cache misses in case someone wants to register a missing model\n return null;\n }\n const klass = factory.class;\n if (klass.isModel) {\n const hasOwnModelNameSet = klass.modelName && Object.prototype.hasOwnProperty.call(klass, 'modelName');\n if (!hasOwnModelNameSet) {\n Object.defineProperty(klass, 'modelName', {\n value: type\n });\n }\n }\n cache[type] = factory;\n }\n return factory;\n}\nexport { ModelSchemaProvider as M, buildSchema as b, getModelFactory as g };","import { macroCondition, getGlobalConfig } from '@embroider/macros';\nconst defaultRules = {\n plurals: [[/$/, 's'], [/s$/i, 's'], [/^(ax|test)is$/i, '$1es'], [/(octop|vir)us$/i, '$1i'], [/(octop|vir)i$/i, '$1i'], [/(alias|status|bonus)$/i, '$1es'], [/(bu)s$/i, '$1ses'], [/(buffal|tomat)o$/i, '$1oes'], [/([ti])um$/i, '$1a'], [/([ti])a$/i, '$1a'], [/sis$/i, 'ses'], [/(?:([^f])fe|([lr])f)$/i, '$1$2ves'], [/(hive)$/i, '$1s'], [/([^aeiouy]|qu)y$/i, '$1ies'], [/(x|ch|ss|sh)$/i, '$1es'], [/(matr|vert|ind)(?:ix|ex)$/i, '$1ices'], [/^(m|l)ouse$/i, '$1ice'], [/^(m|l)ice$/i, '$1ice'], [/^(ox)$/i, '$1en'], [/^(oxen)$/i, '$1'], [/(quiz)$/i, '$1zes']],\n singular: [[/s$/i, ''], [/(ss)$/i, '$1'], [/(n)ews$/i, '$1ews'], [/([ti])a$/i, '$1um'], [/((a)naly|(b)a|(d)iagno|(p)arenthe|(p)rogno|(s)ynop|(t)he)(sis|ses)$/i, '$1sis'], [/(^analy)(sis|ses)$/i, '$1sis'], [/([^f])ves$/i, '$1fe'], [/(hive)s$/i, '$1'], [/(tive)s$/i, '$1'], [/([lr])ves$/i, '$1f'], [/([^aeiouy]|qu)ies$/i, '$1y'], [/(s)eries$/i, '$1eries'], [/(m)ovies$/i, '$1ovie'], [/(x|ch|ss|sh)es$/i, '$1'], [/^(m|l)ice$/i, '$1ouse'], [/(bus)(es)?$/i, '$1'], [/(o)es$/i, '$1'], [/(shoe)s$/i, '$1'], [/(cris|test)(is|es)$/i, '$1is'], [/^(a)x[ie]s$/i, '$1xis'], [/(octop|vir)(us|i)$/i, '$1us'], [/(alias|status|bonus)(es)?$/i, '$1'], [/^(ox)en/i, '$1'], [/(vert|ind)ices$/i, '$1ex'], [/(matr)ices$/i, '$1ix'], [/(quiz)zes$/i, '$1'], [/(database)s$/i, '$1']],\n irregularPairs: [['person', 'people'], ['man', 'men'], ['child', 'children'], ['sex', 'sexes'], ['move', 'moves'], ['cow', 'kine'], ['zombie', 'zombies']],\n uncountable: ['equipment', 'information', 'rice', 'money', 'species', 'series', 'fish', 'sheep', 'jeans', 'police']\n};\nconst DEFAULT_MAX_CACHE_SIZE = 10_000;\nclass LRUCache {\n // debug stats\n\n constructor(doWork, size) {\n this.size = size || DEFAULT_MAX_CACHE_SIZE;\n this.state = new Map();\n this.doWork = doWork;\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n this._hits = 0;\n this._misses = 0;\n this._ejected = 0;\n }\n }\n get(key) {\n const value = this.state.get(key);\n if (value) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n this._hits++;\n }\n this.state.delete(key);\n this.state.set(key, value);\n return value;\n }\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n this._misses++;\n }\n const newValue = this.doWork(key);\n this.set(key, newValue);\n return newValue;\n }\n set(key, value) {\n if (this.state.size === this.size) {\n for (const [k] of this.state) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n this._ejected++;\n }\n this.state.delete(k);\n break;\n }\n }\n this.state.set(key, value);\n }\n clear() {\n this.state.clear();\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n this._hits = 0;\n this._misses = 0;\n this._ejected = 0;\n }\n }\n}\nconst STRING_DASHERIZE_REGEXP = /[ _]/g;\nconst STRING_DECAMELIZE_REGEXP = /([a-z\\d])([A-Z])/g;\nconst STRING_DASHERIZE_CACHE = new LRUCache(key => key.replace(STRING_DECAMELIZE_REGEXP, '$1_$2').toLowerCase().replace(STRING_DASHERIZE_REGEXP, '-'));\n\n// eslint-disable-next-line no-useless-escape\nconst STRING_CAMELIZE_REGEXP_1 = /(\\-|\\_|\\.|\\s)+(.)?/g;\nconst STRING_CAMELIZE_REGEXP_2 = /(^|\\/)([A-Z])/g;\nconst CAMELIZE_CACHE = new LRUCache(key => key.replace(STRING_CAMELIZE_REGEXP_1, (_match, _separator, chr) => chr ? chr.toUpperCase() : '').replace(STRING_CAMELIZE_REGEXP_2, (match /*, separator, chr */) => match.toLowerCase()));\nconst STRING_UNDERSCORE_REGEXP_1 = /([a-z\\d])([A-Z]+)/g;\n// eslint-disable-next-line no-useless-escape\nconst STRING_UNDERSCORE_REGEXP_2 = /\\-|\\s+/g;\nconst UNDERSCORE_CACHE = new LRUCache(str => str.replace(STRING_UNDERSCORE_REGEXP_1, '$1_$2').replace(STRING_UNDERSCORE_REGEXP_2, '_').toLowerCase());\nconst STRING_CAPITALIZE_REGEXP = /(^|\\/)([a-z\\u00C0-\\u024F])/g;\nconst CAPITALIZE_CACHE = new LRUCache(str => str.replace(STRING_CAPITALIZE_REGEXP, (match /*, separator, chr */) => match.toUpperCase()));\n\n/**\n Replaces underscores, spaces, or camelCase with dashes.\n\n ```js\n import { dasherize } from '@ember-data/request-utils/string';\n\n dasherize('innerHTML'); // 'inner-html'\n dasherize('action_name'); // 'action-name'\n dasherize('css-class-name'); // 'css-class-name'\n dasherize('my favorite items'); // 'my-favorite-items'\n dasherize('privateDocs/ownerInvoice'; // 'private-docs/owner-invoice'\n ```\n\n @typedoc\n*/\nfunction dasherize(str) {\n return STRING_DASHERIZE_CACHE.get(str);\n}\n\n/**\n Returns the lowerCamelCase form of a string.\n\n ```js\n import { camelize } from '@ember-data/request-utils/string';\n\n camelize('innerHTML'); // 'innerHTML'\n camelize('action_name'); // 'actionName'\n camelize('css-class-name'); // 'cssClassName'\n camelize('my favorite items'); // 'myFavoriteItems'\n camelize('My Favorite Items'); // 'myFavoriteItems'\n camelize('private-docs/owner-invoice'); // 'privateDocs/ownerInvoice'\n```\n\n @typedoc\n*/\nfunction camelize(str) {\n return CAMELIZE_CACHE.get(str);\n}\n\n/**\n Returns the lower\\_case\\_and\\_underscored form of a string.\n\n ```js\n import { underscore } from '@ember-data/request-utils/string';\n\n underscore('innerHTML'); // 'inner_html'\n underscore('action_name'); // 'action_name'\n underscore('css-class-name'); // 'css_class_name'\n underscore('my favorite items'); // 'my_favorite_items'\n underscore('privateDocs/ownerInvoice'); // 'private_docs/owner_invoice'\n ```\n\n @typedoc\n*/\nfunction underscore(str) {\n return UNDERSCORE_CACHE.get(str);\n}\n\n/**\n Returns the Capitalized form of a string\n\n ```js\n import { capitalize } from '@ember-data/request-utils/string';\n\n capitalize('innerHTML') // 'InnerHTML'\n capitalize('action_name') // 'Action_name'\n capitalize('css-class-name') // 'Css-class-name'\n capitalize('my favorite items') // 'My favorite items'\n capitalize('privateDocs/ownerInvoice'); // 'PrivateDocs/ownerInvoice'\n ```\n\n @typedoc\n*/\nfunction capitalize(str) {\n return CAPITALIZE_CACHE.get(str);\n}\nfunction setMaxLRUCacheSize(size) {\n CAMELIZE_CACHE.size = size;\n UNDERSCORE_CACHE.size = size;\n CAPITALIZE_CACHE.size = size;\n STRING_DASHERIZE_CACHE.size = size;\n}\nconst BLANK_REGEX = /^\\s*$/;\nconst LAST_WORD_DASHED_REGEX = /([\\w/-]+[_/\\s-])([a-z\\d]+$)/;\nconst LAST_WORD_CAMELIZED_REGEX = /([\\w/\\s-]+)([A-Z][a-z\\d]*$)/;\nconst CAMELIZED_REGEX = /[A-Z][a-z\\d]*$/;\nconst SINGULARS = new LRUCache(word => {\n return _singularize(word);\n});\nconst PLURALS = new LRUCache(word => {\n return _pluralize(word);\n});\nconst UNCOUNTABLE = new Set(defaultRules.uncountable);\nconst IRREGULAR = new Map();\nconst INVERSE_IRREGULAR = new Map();\nconst SINGULAR_RULES = new Map(defaultRules.singular.reverse());\nconst PLURAL_RULES = new Map(defaultRules.plurals.reverse());\nfunction uncountable(word) {\n UNCOUNTABLE.add(word.toLowerCase());\n}\nfunction loadUncountable(uncountables) {\n uncountables.forEach(word => {\n uncountable(word);\n });\n}\nfunction irregular(single, plur) {\n //pluralizing\n IRREGULAR.set(single.toLowerCase(), plur);\n IRREGULAR.set(plur.toLowerCase(), plur);\n\n //singularizing\n INVERSE_IRREGULAR.set(plur.toLowerCase(), single);\n INVERSE_IRREGULAR.set(single.toLowerCase(), single);\n}\nfunction loadIrregular(irregularPairs) {\n irregularPairs.forEach(pair => {\n //pluralizing\n IRREGULAR.set(pair[0].toLowerCase(), pair[1]);\n IRREGULAR.set(pair[1].toLowerCase(), pair[1]);\n\n //singularizing\n INVERSE_IRREGULAR.set(pair[1].toLowerCase(), pair[0]);\n INVERSE_IRREGULAR.set(pair[0].toLowerCase(), pair[0]);\n });\n}\nloadIrregular(defaultRules.irregularPairs);\nfunction clear() {\n SINGULARS.clear();\n PLURALS.clear();\n}\nfunction resetToDefaults() {\n clearRules();\n defaultRules.uncountable.forEach(v => UNCOUNTABLE.add(v));\n defaultRules.singular.forEach(v => SINGULAR_RULES.set(v[0], v[1]));\n defaultRules.plurals.forEach(v => PLURAL_RULES.set(v[0], v[1]));\n loadIrregular(defaultRules.irregularPairs);\n}\nfunction clearRules() {\n SINGULARS.clear();\n PLURALS.clear();\n UNCOUNTABLE.clear();\n IRREGULAR.clear();\n INVERSE_IRREGULAR.clear();\n SINGULAR_RULES.clear();\n PLURAL_RULES.clear();\n}\nfunction singularize(word) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`singularize expects to receive a non-empty string`);\n }\n })(typeof word === 'string' && word.length > 0) : {};\n if (!word) return '';\n return SINGULARS.get(word);\n}\nfunction pluralize(word) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`pluralize expects to receive a non-empty string`);\n }\n })(typeof word === 'string' && word.length > 0) : {};\n if (!word) return '';\n return PLURALS.get(word);\n}\nfunction unshiftMap(v, map) {\n // reorder\n const rules = [v, ...map.entries()];\n map.clear();\n rules.forEach(rule => {\n map.set(rule[0], rule[1]);\n });\n}\nfunction plural(regex, string) {\n // rule requires reordering if exists, so remove it first\n if (PLURAL_RULES.has(regex)) {\n PLURAL_RULES.delete(regex);\n }\n\n // reorder\n unshiftMap([regex, string], PLURAL_RULES);\n}\nfunction singular(regex, string) {\n // rule requires reordering if exists, so remove it first\n if (SINGULAR_RULES.has(regex)) {\n SINGULAR_RULES.delete(regex);\n }\n\n // reorder\n unshiftMap([regex, string], SINGULAR_RULES);\n}\nfunction _pluralize(word) {\n return inflect(word, PLURAL_RULES, IRREGULAR);\n}\nfunction _singularize(word) {\n return inflect(word, SINGULAR_RULES, INVERSE_IRREGULAR);\n}\nfunction inflect(word, typeRules, irregulars) {\n // empty strings\n const isBlank = !word || BLANK_REGEX.test(word);\n if (isBlank) {\n return word;\n }\n\n // basic uncountables\n const lowercase = word.toLowerCase();\n if (UNCOUNTABLE.has(lowercase)) {\n return word;\n }\n\n // adv uncountables\n const wordSplit = LAST_WORD_DASHED_REGEX.exec(word) || LAST_WORD_CAMELIZED_REGEX.exec(word);\n const lastWord = wordSplit ? wordSplit[2].toLowerCase() : null;\n if (lastWord && UNCOUNTABLE.has(lastWord)) {\n return word;\n }\n\n // handle irregulars\n const isCamelized = CAMELIZED_REGEX.test(word);\n for (let [rule, substitution] of irregulars) {\n if (lowercase.match(rule + '$')) {\n if (isCamelized && lastWord && irregulars.has(lastWord)) {\n substitution = capitalize(substitution);\n rule = capitalize(rule);\n }\n return word.replace(new RegExp(rule, 'i'), substitution);\n }\n }\n\n // do the actual inflection\n for (const [rule, substitution] of typeRules) {\n if (rule.test(word)) {\n return word.replace(rule, substitution);\n }\n }\n return word;\n}\nexport { singular as a, plural as b, loadUncountable as c, clear as d, clearRules as e, dasherize as f, camelize as g, capitalize as h, irregular as i, underscore as j, setMaxLRUCacheSize as k, loadIrregular as l, defaultRules as m, pluralize as p, resetToDefaults as r, singularize as s, uncountable as u };","import { getOrSetUniversal, getOrSetGlobal } from '@warp-drive/core-types/-private';\nimport { STRUCTURED, IS_FUTURE, SkipCache } from '@warp-drive/core-types/request';\nimport { macroCondition, getGlobalConfig } from '@embroider/macros';\nconst PromiseCache = getOrSetUniversal('PromiseCache', new WeakMap());\nconst RequestMap = getOrSetUniversal('RequestMap', new Map());\nfunction setRequestResult(requestId, result) {\n RequestMap.set(requestId, result);\n}\nfunction clearRequestResult(requestId) {\n RequestMap.delete(requestId);\n}\nfunction getRequestResult(requestId) {\n return RequestMap.get(requestId);\n}\nfunction setPromiseResult(promise, result) {\n PromiseCache.set(promise, result);\n}\nfunction getPromiseResult(promise) {\n return PromiseCache.get(promise);\n}\nconst IS_CACHE_HANDLER = getOrSetGlobal('IS_CACHE_HANDLER', Symbol('IS_CACHE_HANDLER'));\nfunction curryFuture(owner, inbound, outbound) {\n owner.setStream(inbound.getStream());\n inbound.then(doc => {\n const document = {\n [STRUCTURED]: true,\n request: owner.request,\n response: doc.response,\n content: doc.content\n };\n outbound.resolve(document);\n }, error => {\n if (isDoc(error)) {\n owner.setStream(owner.god.stream);\n }\n if (!error || !(error instanceof Error)) {\n try {\n throw new Error(error ? error : `Request Rejected with an Unknown Error`);\n } catch (e) {\n if (error && typeof error === 'object') {\n Object.assign(e, error);\n e.message = error.message || `Request Rejected with an Unknown Error`;\n }\n error = e;\n }\n }\n error[STRUCTURED] = true;\n error.request = owner.request;\n error.response = owner.getResponse();\n error.error = error.error || error.message;\n outbound.reject(error);\n });\n return outbound.promise;\n}\nfunction isDoc(doc) {\n return doc && doc[STRUCTURED] === true;\n}\nfunction ensureDoc(owner, content, isError) {\n if (isDoc(content)) {\n return content;\n }\n if (isError) {\n return {\n [STRUCTURED]: true,\n request: owner.request,\n response: owner.getResponse(),\n error: content\n };\n }\n return {\n [STRUCTURED]: true,\n request: owner.request,\n response: owner.getResponse(),\n content: content\n };\n}\nfunction enhanceReason(reason) {\n return new DOMException(reason || 'The user aborted a request.', 'AbortError');\n}\nfunction handleOutcome(owner, inbound, outbound) {\n inbound.then(content => {\n if (owner.controller.signal.aborted) {\n // the next function did not respect the signal, we handle it here\n outbound.reject(enhanceReason(owner.controller.signal.reason));\n return;\n }\n if (isDoc(content)) {\n owner.setStream(owner.god.stream);\n content = content.content;\n }\n const document = {\n [STRUCTURED]: true,\n request: owner.request,\n response: owner.getResponse(),\n content\n };\n outbound.resolve(document);\n }, error => {\n if (isDoc(error)) {\n owner.setStream(owner.god.stream);\n }\n if (!error || !(error instanceof Error)) {\n try {\n throw new Error(error ? error : `Request Rejected with an Unknown Error`);\n } catch (e) {\n if (error && typeof error === 'object') {\n Object.assign(e, error);\n e.message = error.message || `Request Rejected with an Unknown Error`;\n }\n error = e;\n }\n }\n error[STRUCTURED] = true;\n error.request = owner.request;\n error.response = owner.getResponse();\n error.error = error.error || error.message;\n outbound.reject(error);\n });\n return outbound.promise;\n}\nfunction isCacheHandler(handler, index) {\n return index === 0 && Boolean(handler[IS_CACHE_HANDLER]);\n}\nfunction executeNextHandler(wares, request, i, god) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (i === wares.length) {\n throw new Error(`No handler was able to handle this request.`);\n }\n assertValidRequest(request, false);\n }\n const owner = new ContextOwner(request, god, i === 0);\n function next(r) {\n owner.nextCalled++;\n return executeNextHandler(wares, r, i + 1, god);\n }\n const context = new Context(owner);\n let outcome;\n try {\n outcome = wares[i].request(context, next);\n if (!!outcome && isCacheHandler(wares[i], i)) {\n if (!(outcome instanceof Promise)) {\n setRequestResult(owner.requestId, {\n isError: false,\n result: ensureDoc(owner, outcome, false)\n });\n outcome = Promise.resolve(outcome);\n }\n } else if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (!outcome || !(outcome instanceof Promise) && !(typeof outcome === 'object' && 'then' in outcome)) {\n // eslint-disable-next-line no-console\n console.log({\n request,\n handler: wares[i],\n outcome\n });\n if (outcome === undefined) {\n throw new Error(`Expected handler.request to return a promise, instead received undefined.`);\n }\n throw new Error(`Expected handler.request to return a promise, instead received a synchronous value.`);\n }\n }\n } catch (e) {\n if (isCacheHandler(wares[i], i)) {\n setRequestResult(owner.requestId, {\n isError: true,\n result: ensureDoc(owner, e, true)\n });\n }\n outcome = Promise.reject(e);\n }\n const future = createFuture(owner);\n if (isFuture(outcome)) {\n return curryFuture(owner, outcome, future);\n }\n return handleOutcome(owner, outcome, future);\n}\nfunction isFuture(maybe) {\n return Boolean(maybe && maybe instanceof Promise && maybe[IS_FUTURE] === true);\n}\nfunction createDeferred() {\n let resolve;\n let reject;\n const promise = new Promise((res, rej) => {\n resolve = res;\n reject = rej;\n });\n return {\n resolve,\n reject,\n promise\n };\n}\nfunction upgradePromise(promise, future) {\n promise[IS_FUTURE] = true;\n // eslint-disable-next-line @typescript-eslint/unbound-method\n promise.getStream = future.getStream;\n // eslint-disable-next-line @typescript-eslint/unbound-method\n promise.abort = future.abort;\n // eslint-disable-next-line @typescript-eslint/unbound-method\n promise.onFinalize = future.onFinalize;\n return promise;\n}\nfunction createFuture(owner) {\n const deferred = createDeferred();\n let {\n promise\n } = deferred;\n let cbs;\n promise = promise.finally(() => {\n owner.resolveStream();\n if (cbs) {\n cbs.forEach(cb => cb());\n }\n });\n promise.onFinalize = fn => {\n cbs = cbs || [];\n cbs.push(fn);\n };\n promise[IS_FUTURE] = true;\n promise.getStream = () => {\n return owner.getStream();\n };\n promise.abort = reason => {\n owner.abort(enhanceReason(reason));\n };\n deferred.promise = promise;\n return deferred;\n}\nfunction upgradeHeaders(headers) {\n headers.clone = () => {\n return new Headers(headers);\n };\n headers.toJSON = () => {\n return Array.from(headers);\n };\n return headers;\n}\nfunction cloneResponseProperties(response) {\n const {\n headers,\n ok,\n redirected,\n status,\n statusText,\n type,\n url\n } = response;\n upgradeHeaders(headers);\n return {\n headers: headers,\n ok,\n redirected,\n status,\n statusText,\n type,\n url\n };\n}\nclass ContextOwner {\n hasSetStream = false;\n hasSetResponse = false;\n hasSubscribers = false;\n stream = createDeferred();\n response = null;\n nextCalled = 0;\n constructor(request, god, isRoot = false) {\n this.isRoot = isRoot;\n this.requestId = god.id;\n this.controller = request.controller || god.controller;\n this.stream.promise.sizeHint = 0;\n if (request.controller) {\n if (request.controller !== god.controller) {\n god.controller.signal.addEventListener('abort', () => {\n this.controller.abort(god.controller.signal.reason);\n });\n }\n delete request.controller;\n }\n let enhancedRequest = Object.assign({\n signal: this.controller.signal\n }, request);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (!request?.cacheOptions?.[SkipCache]) {\n request = deepFreeze(request);\n enhancedRequest = deepFreeze(enhancedRequest);\n }\n } else {\n if (request.headers) {\n upgradeHeaders(request.headers);\n }\n }\n this.enhancedRequest = enhancedRequest;\n this.request = request;\n this.god = god;\n this.stream.promise = this.stream.promise.then(stream => {\n if (this.god.stream === stream && this.hasSubscribers) {\n this.god.stream = null;\n }\n return stream;\n });\n }\n get hasRequestedStream() {\n return this.god.hasRequestedStream;\n }\n getResponse() {\n if (this.hasSetResponse) {\n return this.response;\n }\n if (this.nextCalled === 1) {\n return this.god.response;\n }\n return null;\n }\n getStream() {\n if (this.isRoot) {\n this.god.hasRequestedStream = true;\n }\n if (!this.hasSetResponse) {\n const hint = this.god.response?.headers?.get('content-length');\n this.stream.promise.sizeHint = hint ? parseInt(hint, 10) : 0;\n }\n this.hasSubscribers = true;\n return this.stream.promise;\n }\n abort(reason) {\n this.controller.abort(reason);\n }\n setStream(stream) {\n if (!this.hasSetStream) {\n this.hasSetStream = true;\n if (!(stream instanceof Promise)) {\n this.god.stream = stream;\n }\n // @ts-expect-error\n this.stream.resolve(stream);\n }\n }\n resolveStream() {\n this.setStream(this.nextCalled === 1 ? this.god.stream : null);\n }\n setResponse(response) {\n if (this.hasSetResponse) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n throw new Error(`Cannot setResponse when a response has already been set`);\n }\n return;\n }\n this.hasSetResponse = true;\n if (response instanceof Response) {\n // TODO potentially avoid cloning in prod\n let responseData = cloneResponseProperties(response);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n responseData = deepFreeze(responseData);\n }\n this.response = responseData;\n this.god.response = responseData;\n const sizeHint = response.headers?.get('content-length');\n this.stream.promise.sizeHint = sizeHint ? parseInt(sizeHint, 10) : 0;\n } else {\n this.response = response;\n this.god.response = response;\n }\n }\n}\nclass Context {\n #owner;\n constructor(owner) {\n this.id = owner.requestId;\n this.#owner = owner;\n this.request = owner.enhancedRequest;\n }\n setStream(stream) {\n this.#owner.setStream(stream);\n }\n setResponse(response) {\n this.#owner.setResponse(response);\n }\n get hasRequestedStream() {\n return this.#owner.hasRequestedStream;\n }\n}\nconst BODY_TYPES = {\n type: 'string',\n klass: ['Blob', 'ArrayBuffer', 'TypedArray', 'DataView', 'FormData', 'URLSearchParams', 'ReadableStream']\n};\nconst ValidKeys = new Map([['records', 'array'], ['data', 'json'], ['body', BODY_TYPES], ['disableTestWaiter', 'boolean'], ['options', 'object'], ['cacheOptions', 'object'], ['op', 'string'], ['store', 'object'], ['url', 'string'], ['cache', ['default', 'force-cache', 'no-cache', 'no-store', 'only-if-cached', 'reload']], ['credentials', ['include', 'omit', 'same-origin']], ['destination', ['', 'object', 'audio', 'audioworklet', 'document', 'embed', 'font', 'frame', 'iframe', 'image', 'manifest', 'paintworklet', 'report', 'script', 'sharedworker', 'style', 'track', 'video', 'worker', 'xslt']], ['headers', 'headers'], ['integrity', 'string'], ['keepalive', 'boolean'], ['method', ['GET', 'PUT', 'PATCH', 'DELETE', 'POST', 'OPTIONS']], ['mode', ['same-origin', 'cors', 'navigate', 'no-cors']], ['redirect', ['error', 'follow', 'manual']], ['referrer', 'string'], ['signal', 'AbortSignal'], ['controller', 'AbortController'], ['referrerPolicy', ['', 'same-origin', 'no-referrer', 'no-referrer-when-downgrade', 'origin', 'origin-when-cross-origin', 'strict-origin', 'strict-origin-when-cross-origin', 'unsafe-url']]]);\nconst IS_FROZEN = getOrSetGlobal('IS_FROZEN', Symbol('FROZEN'));\nconst IS_COLLECTION = getOrSetGlobal('IS_COLLECTION', Symbol.for('Collection'));\nfunction freezeHeaders(headers) {\n headers.delete = headers.set = headers.append = () => {\n throw new Error(`Cannot Mutate Immutatable Headers, use headers.clone to get a copy`);\n };\n upgradeHeaders(headers);\n return headers;\n}\nfunction deepFreeze(value) {\n if (value && value[IS_FROZEN]) {\n return value;\n }\n const _type = typeof value;\n switch (_type) {\n case 'boolean':\n case 'string':\n case 'number':\n case 'symbol':\n case 'undefined':\n case 'bigint':\n return value;\n case 'function':\n throw new Error(`Cannot deep-freeze a function`);\n case 'object':\n {\n const _niceType = niceTypeOf(value);\n switch (_niceType) {\n case 'array':\n {\n if (value[IS_COLLECTION]) {\n return value;\n }\n const arr = value.map(deepFreeze);\n arr[IS_FROZEN] = true;\n return Object.freeze(arr);\n }\n case 'null':\n return value;\n case 'object':\n Object.keys(value).forEach(key => {\n try {\n value[key] = deepFreeze(value[key]);\n } catch {\n // continue\n }\n });\n value[IS_FROZEN] = true;\n return Object.freeze(value);\n case 'headers':\n return freezeHeaders(value);\n case 'Collection':\n case 'Store':\n case 'AbortSignal':\n return value;\n case 'date':\n case 'map':\n case 'set':\n case 'error':\n case 'stream':\n default:\n // console.log(`Cannot deep-freeze ${_niceType}`);\n return value;\n }\n }\n }\n}\nfunction isMaybeContext(request) {\n if (request && typeof request === 'object') {\n const keys = Object.keys(request);\n if (keys.length === 1 && keys[0] === 'request') {\n return true;\n }\n }\n return false;\n}\nfunction niceTypeOf(v) {\n if (v === null) {\n return 'null';\n }\n if (typeof v === 'string') {\n return v ? 'non-empty-string' : 'empty-string';\n }\n if (!v) {\n return typeof v;\n }\n if (Array.isArray(v)) {\n return 'array';\n }\n if (v instanceof Date) {\n return 'date';\n }\n if (v instanceof Map) {\n return 'map';\n }\n if (v instanceof Set) {\n return 'set';\n }\n if (v instanceof Error) {\n return 'error';\n }\n if (v instanceof ReadableStream || v instanceof WritableStream || v instanceof TransformStream) {\n return 'stream';\n }\n if (v instanceof Headers) {\n return 'headers';\n }\n if (typeof v === 'object' && v.constructor && v.constructor.name !== 'Object') {\n return v.constructor.name;\n }\n return typeof v;\n}\nfunction validateKey(key, value, errors) {\n const schema = ValidKeys.get(key);\n if (!schema && !IgnoredKeys.has(key)) {\n errors.push(`InvalidKey: '${key}'`);\n return;\n }\n if (schema) {\n if (schema === BODY_TYPES) {\n if (typeof value === 'string' || value instanceof ReadableStream) {\n return;\n }\n const type = niceTypeOf(value);\n if (schema.klass.includes(type)) {\n return;\n }\n errors.push(`InvalidValue: key 'body' should be a string or one of '${schema.klass.join(\"', '\")}', received ${''}`);\n return;\n }\n if (Array.isArray(schema)) {\n if (!schema.includes(value)) {\n errors.push(`InvalidValue: key ${key} should be a one of '${schema.join(\"', '\")}', received ${typeof value === 'string' ? value : ''}`);\n }\n return;\n } else if (schema === 'json') {\n try {\n JSON.stringify(value);\n } catch (e) {\n errors.push(`InvalidValue: key ${key} should be a JSON serializable value, but failed to serialize with Error - ${e.message}`);\n }\n return;\n } else if (schema === 'headers') {\n if (!(value instanceof Headers)) {\n errors.push(`InvalidValue: key ${key} should be an instance of Headers, received ${niceTypeOf(value)}`);\n }\n return;\n } else if (schema === 'record') {\n const _type = typeof value;\n // record must extend plain object or Object.create(null)\n if (!value || _type !== 'object' || value.constructor && value.constructor !== Object) {\n errors.push(`InvalidValue: key ${key} should be a dictionary of string keys to string values, received ${niceTypeOf(value)}`);\n return;\n }\n const keys = Object.keys(value);\n keys.forEach(k => {\n const v = value[k];\n if (typeof k !== 'string') {\n errors.push(`\\tThe key ${String(k)} on ${key} should be a string key`);\n } else if (typeof v !== 'string') {\n errors.push(`\\tThe value of ${key}.${k} should be a string not ${niceTypeOf(v)}`);\n }\n });\n return;\n } else if (schema === 'string') {\n if (typeof value !== 'string' || value.length === 0) {\n errors.push(`InvalidValue: key ${key} should be a non-empty string, received ${typeof value === 'string' ? \"''\" : typeof value}`);\n }\n return;\n } else if (schema === 'object') {\n if (!value || Array.isArray(value) || typeof value !== 'object') {\n errors.push(`InvalidValue: key ${key} should be an object`);\n }\n return;\n } else if (schema === 'boolean') {\n if (typeof value !== 'boolean') {\n errors.push(`InvalidValue: key ${key} should be a boolean, received ${typeof value}`);\n }\n return;\n } else if (schema === 'array') {\n if (!Array.isArray(value)) {\n errors.push(`InvalidValue: key ${key} should be an array, received ${typeof value}`);\n }\n return;\n }\n }\n}\nconst IgnoredKeys = new Set([]);\nfunction assertValidRequest(request, isTopLevel) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n // handle basic shape\n if (!request) {\n throw new Error(`Expected ${isTopLevel ? 'RequestManager.request' : 'next'}() to be called with a request, but none was provided.`);\n }\n if (Array.isArray(request) || typeof request !== 'object') {\n throw new Error(`The \\`request\\` passed to \\`${isTopLevel ? 'RequestManager.request' : 'next'}()\\` should be an object, received \\`${niceTypeOf(request)}\\``);\n }\n if (Object.keys(request).length === 0) {\n throw new Error(`The \\`request\\` passed to \\`${isTopLevel ? 'RequestManager.request' : 'next'}()\\` was empty (\\`{}\\`). Requests need at least one valid key.`);\n }\n\n // handle accidentally passing context entirely\n if (request instanceof Context) {\n throw new Error(`Expected a request passed to \\`${isTopLevel ? 'RequestManager.request' : 'next'}()\\` but received the previous handler's context instead`);\n }\n // handle Object.assign({}, context);\n if (isMaybeContext(request)) {\n throw new Error(`Expected a request passed to \\`${isTopLevel ? 'RequestManager.request' : 'next'}()\\` but received an object with a request key instead.`);\n }\n\n // handle schema\n const keys = Object.keys(request);\n const validationErrors = [];\n const isLegacyRequest = Boolean('op' in request && !request.url);\n keys.forEach(key => {\n if (isLegacyRequest && key === 'data') {\n return;\n }\n validateKey(key, request[key], validationErrors);\n });\n if (validationErrors.length) {\n const error = new Error(`Invalid Request passed to \\`${isTopLevel ? 'RequestManager.request' : 'next'}()\\`.\\n\\nThe following issues were found:\\n\\n\\t${validationErrors.join('\\n\\t')}`);\n error.errors = validationErrors;\n throw error;\n }\n }\n}\nexport { IS_CACHE_HANDLER as I, assertValidRequest as a, createDeferred as b, clearRequestResult as c, getPromiseResult as d, executeNextHandler as e, cloneResponseProperties as f, getRequestResult as g, setPromiseResult as s, upgradePromise as u };","import { f as cloneResponseProperties } from \"./debug-DGStaRpE.js\";\nimport { macroCondition, getGlobalConfig } from '@embroider/macros';\n\n/**\n * A basic Fetch Handler which converts a request into a\n * `fetch` call presuming the response to be `json`.\n *\n * ```ts\n * import Fetch from '@ember-data/request/fetch';\n *\n * manager.use([Fetch]);\n * ```\n *\n * @module @ember-data/request/fetch\n * @main @ember-data/request/fetch\n */\n\n// Lazily close over fetch to avoid breaking Mirage\nconst _fetch = typeof fetch !== 'undefined' ? (...args) => fetch(...args) : typeof FastBoot !== 'undefined' ? (...args) => FastBoot.require('node-fetch')(...args) : () => {\n throw new Error('No Fetch Implementation Found');\n};\n\n// clones a response in a way that should still\n// allow it to stream\nfunction cloneResponse(response, overrides) {\n const props = cloneResponseProperties(response);\n return new Response(response.body, Object.assign(props, overrides));\n}\nlet IS_MAYBE_MIRAGE = () => false;\nif (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n IS_MAYBE_MIRAGE = () => Boolean(typeof window !== 'undefined' && (window.server?.pretender || window.fetch.toString().replace(/\\s+/g, '') !== 'function fetch() { [native code] }'.replace(/\\s+/g, '')));\n}\nconst MUTATION_OPS = new Set(['updateRecord', 'createRecord', 'deleteRecord']);\nconst ERROR_STATUS_CODE_FOR = new Map([[400, 'Bad Request'], [401, 'Unauthorized'], [402, 'Payment Required'], [403, 'Forbidden'], [404, 'Not Found'], [405, 'Method Not Allowed'], [406, 'Not Acceptable'], [407, 'Proxy Authentication Required'], [408, 'Request Timeout'], [409, 'Conflict'], [410, 'Gone'], [411, 'Length Required'], [412, 'Precondition Failed'], [413, 'Payload Too Large'], [414, 'URI Too Long'], [415, 'Unsupported Media Type'], [416, 'Range Not Satisfiable'], [417, 'Expectation Failed'], [419, 'Page Expired'], [420, 'Enhance Your Calm'], [421, 'Misdirected Request'], [422, 'Unprocessable Entity'], [423, 'Locked'], [424, 'Failed Dependency'], [425, 'Too Early'], [426, 'Upgrade Required'], [428, 'Precondition Required'], [429, 'Too Many Requests'], [430, 'Request Header Fields Too Large'], [431, 'Request Header Fields Too Large'], [450, 'Blocked By Windows Parental Controls'], [451, 'Unavailable For Legal Reasons'], [500, 'Internal Server Error'], [501, 'Not Implemented'], [502, 'Bad Gateway'], [503, 'Service Unavailable'], [504, 'Gateway Timeout'], [505, 'HTTP Version Not Supported'], [506, 'Variant Also Negotiates'], [507, 'Insufficient Storage'], [508, 'Loop Detected'], [509, 'Bandwidth Limit Exceeded'], [510, 'Not Extended'], [511, 'Network Authentication Required']]);\n\n/**\n * A basic handler which converts a request into a\n * `fetch` call presuming the response to be `json`.\n *\n * ```ts\n * import Fetch from '@ember-data/request/fetch';\n *\n * manager.use([Fetch]);\n * ```\n *\n * @class Fetch\n * @public\n */\nconst Fetch = {\n async request(context) {\n let response;\n try {\n response = await _fetch(context.request.url, context.request);\n } catch (e) {\n if (e instanceof DOMException && e.name === 'AbortError') {\n e.statusText = 'Aborted';\n e.status = 20;\n e.isRequestError = true;\n } else {\n e.statusText = 'Unknown Network Error';\n e.status = 0;\n e.isRequestError = true;\n }\n throw e;\n }\n const isError = !response.ok || response.status >= 400;\n const op = context.request.op;\n const isMutationOp = Boolean(op && MUTATION_OPS.has(op));\n if (!isError && !isMutationOp && response.status !== 204 && !response.headers.has('date')) {\n if (IS_MAYBE_MIRAGE()) {\n response.headers.set('date', new Date().toUTCString());\n } else {\n const headers = new Headers(response.headers);\n headers.set('date', new Date().toUTCString());\n response = cloneResponse(response, {\n headers\n });\n }\n }\n context.setResponse(response);\n if (response.status === 204) {\n return null;\n }\n let text = '';\n // if we are in a mirage context, we cannot support streaming\n if (IS_MAYBE_MIRAGE()) {\n text = await response.text();\n } else {\n const reader = response.body.getReader();\n const decoder = new TextDecoder();\n let isStreaming = context.hasRequestedStream;\n let stream = isStreaming ? new TransformStream() : null;\n let writer = stream?.writable.getWriter();\n if (isStreaming) {\n // Listen for the abort event on the AbortSignal\n context.request.signal?.addEventListener('abort', () => {\n if (!isStreaming) {\n return;\n }\n void stream.writable.abort('Request Aborted');\n void stream.readable.cancel('Request Aborted');\n });\n context.setStream(stream.readable);\n }\n\n // eslint-disable-next-line no-constant-condition\n while (true) {\n // we manually read the stream instead of using `response.json()`\n // or `response.text()` because if we need to stream the body\n // we need to be able to pass the stream along efficiently.\n const {\n done,\n value\n } = await reader.read();\n if (done) {\n if (isStreaming) {\n isStreaming = false;\n await writer.ready;\n await writer.close();\n }\n break;\n }\n text += decoder.decode(value, {\n stream: true\n });\n\n // if we are streaming, we want to pass the stream along\n if (isStreaming) {\n await writer.ready;\n await writer.write(value);\n } else if (context.hasRequestedStream) {\n const encode = new TextEncoder();\n isStreaming = true;\n stream = new TransformStream();\n // Listen for the abort event on the AbortSignal\n // eslint-disable-next-line @typescript-eslint/no-loop-func\n context.request.signal?.addEventListener('abort', () => {\n if (!isStreaming) {\n return;\n }\n void stream.writable.abort('Request Aborted');\n void stream.readable.cancel('Request Aborted');\n });\n context.setStream(stream.readable);\n writer = stream.writable.getWriter();\n await writer.ready;\n await writer.write(encode.encode(text));\n await writer.ready;\n await writer.write(value);\n }\n }\n if (isStreaming) {\n isStreaming = false;\n await writer.ready;\n await writer.close();\n }\n }\n // if we are an error, we will want to throw\n if (isError) {\n let errorPayload;\n try {\n errorPayload = JSON.parse(text);\n } catch {\n // void;\n }\n // attempt errors discovery\n const errors = Array.isArray(errorPayload) ? errorPayload : isDict(errorPayload) && Array.isArray(errorPayload.errors) ? errorPayload.errors : null;\n const statusText = response.statusText || ERROR_STATUS_CODE_FOR.get(response.status) || 'Unknown Request Error';\n const msg = `[${response.status} ${statusText}] ${context.request.method ?? 'GET'} (${response.type}) - ${response.url}`;\n const error = errors ? new AggregateError(errors, msg) : new Error(msg);\n error.status = response.status;\n error.statusText = statusText;\n error.isRequestError = true;\n error.code = error.status;\n error.name = error.statusText.replaceAll(' ', '') + 'Error';\n error.content = errorPayload;\n throw error;\n } else {\n return JSON.parse(text);\n }\n }\n};\nfunction isDict(v) {\n return v !== null && typeof v === 'object';\n}\nexport { Fetch as default };","import { macroCondition, getGlobalConfig, importSync } from '@embroider/macros';\nimport { peekUniversalTransient, setUniversalTransient } from '@warp-drive/core-types/-private';\nimport { I as IS_CACHE_HANDLER, a as assertValidRequest, e as executeNextHandler, g as getRequestResult, u as upgradePromise, s as setPromiseResult, c as clearRequestResult } from \"./debug-DGStaRpE.js\";\nexport { b as createDeferred, d as getPromiseResult } from \"./debug-DGStaRpE.js\";\n\n/* eslint-disable no-irregular-whitespace */\n/**\n *\n
\n\n In order to properly manage and present your data, EmberData\n needs to understand the structure of data it receives.\n\n `Serializers` convert data between the server's API format and\n the format EmberData understands.\n\n Data received from an API response is **normalized** into\n [JSON:API](https://jsonapi.org/) (the format used internally\n by EmberData), while data sent to an API is **serialized**\n into the format the API expects.\n\n ### Implementing a Serializer\n\n There are only two required serializer methods, one for\n normalizing data from the server API format into JSON:API, and\n another for serializing records via `Snapshots` into the expected\n server API format.\n\n To implement a serializer, export a class that conforms to the structure\n described by [ Serializer](/ember-data/release/classes/%3CInterface%3E%20Serializer)\n from the `app/serializers/` directory. An example is below.\n\n ```ts\n import EmberObject from '@ember/object';\n\n export default class ApplicationSerializer extends EmberObject {\n normalizeResponse(store, schema, rawPayload) {\n return rawPayload;\n }\n\n serialize(snapshot, options) {\n const serializedResource = {\n id: snapshot.id,\n type: snapshot.modelName,\n attributes: snapshot.attributes()\n };\n\n return serializedResource;\n }\n }\n ```\n\n\n ### Serializer Resolution\n\n `store.serializerFor(name)` will lookup serializers defined in\n `app/serializers/` and return an instance. If no serializer is found, an\n error will be thrown.\n\n `serializerFor` first attempts to find a serializer with an exact match on `name`,\n then falls back to checking for the presence of a serializer named `application`.\n\n ```ts\n store.serializerFor('author');\n\n // lookup paths (in order) =>\n // app/serializers/author.js\n // app/serializers/application.js\n ```\n\n Most requests in EmberData are made with respect to a particular `type` (or `modelName`)\n (e.g., \"get me the full collection of **books**\" or \"get me the **employee** whose id is 37\"). We\n refer to this as the **primary** resource `type`.\n\n Typically `serializerFor` will be used to find a serializer with a name matching that of the primary\n resource `type` for the request, falling back to the `application` serializer for those types that\n do not have a defined serializer. This is often described as a `per-model` or `per-type` strategy\n for defining serializers. However, because APIs rarely format payloads per-type but rather\n per-API-version, this may not be a desired strategy.\n\n It is recommended that applications define only a single `application` adapter and serializer\n where possible.\n\n If you have multiple API formats and the per-type strategy is not viable, one strategy is to\n write an `application` adapter and serializer that make use of `options` to specify the desired\n format when making a request.\n\n ### Using a Serializer\n\n Any serializer in `app/serializers/` can be looked up by `name` using `store.serializerFor(name)`.\n\n ### Default Serializers\n\n For applications whose APIs are *very close to* or *exactly* the **REST** format or **JSON:API**\n format the `@ember-data/serializer` package contains implementations these applications can\n extend. It also contains a simple `JSONSerializer` for serializing to/from very basic JSON objects.\n\n Many applications will find writing their own serializer to be more performant and less\n complex than extending these classes even when their API format is very close to that expected\n by these serializers.\n\n It is recommended that apps write their own serializer to best suit the needs of their API and\n application.\n\n @module @ember-data/serializer\n @main @ember-data/serializer\n*/\n\n/**\n > ⚠️ CAUTION you likely want the docs for [ Serializer](/ember-data/release/classes/%3CInterface%3E%20Serializer)\n > as extending this abstract class is unnecessary.\n\n `Serializer` is an abstract base class that you may override in your\n application to customize it for your backend. The minimum set of methods\n that you should implement is:\n\n * `normalizeResponse()`\n * `serialize()`\n\n And you can optionally override the following methods:\n\n * `normalize()`\n\n For an example implementation, see\n [JSONSerializer](JSONSerializer), the included JSON serializer.\n\n @class Serializer\n @public\n @extends Ember.EmberObject\n*/\n\nclass Serializer extends EmberObject {\n static {\n decorateFieldV2(this.prototype, \"store\", [inject]);\n }\n #store = (initializeDeferredDecorator(this, \"store\"), void 0);\n /**\n The `store` property is the application's `store` that contains\n all records. It can be used to look up serializers for other model\n types that may be nested inside the payload response.\n Example:\n ```js\n Serializer.extend({\n extractRelationship(relationshipModelName, relationshipHash) {\n let modelClass = this.store.modelFor(relationshipModelName);\n let relationshipSerializer = this.store.serializerFor(relationshipModelName);\n return relationshipSerializer.normalize(modelClass, relationshipHash);\n }\n });\n ```\n @property store\n @type {Store}\n @public\n */\n\n /**\n The `normalizeResponse` method is used to normalize a payload from the\n server to a JSON-API Document.\n http://jsonapi.org/format/#document-structure\n Example:\n ```js\n Serializer.extend({\n normalizeResponse(store, primaryModelClass, payload, id, requestType) {\n if (requestType === 'findRecord') {\n return this.normalize(primaryModelClass, payload);\n } else {\n return payload.reduce(function(documentHash, item) {\n let { data, included } = this.normalize(primaryModelClass, item);\n documentHash.included.push(...included);\n documentHash.data.push(data);\n return documentHash;\n }, { data: [], included: [] })\n }\n }\n });\n ```\n @since 1.13.0\n @method normalizeResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n\n /**\n The `serialize` method is used when a record is saved in order to convert\n the record into the form that your external data source expects.\n `serialize` takes an optional `options` hash with a single option:\n - `includeId`: If this is `true`, `serialize` should include the ID\n in the serialized object it builds.\n Example:\n ```js\n Serializer.extend({\n serialize(snapshot, options) {\n let json = {\n id: snapshot.id\n };\n snapshot.eachAttribute((key, attribute) => {\n json[key] = snapshot.attr(key);\n });\n snapshot.eachRelationship((key, relationship) => {\n if (relationship.kind === 'belongsTo') {\n json[key] = snapshot.belongsTo(key, { id: true });\n } else if (relationship.kind === 'hasMany') {\n json[key] = snapshot.hasMany(key, { ids: true });\n }\n });\n return json;\n },\n });\n ```\n @method serialize\n @public\n @param {Snapshot} snapshot\n @param {Object} [options]\n @return {Object}\n */\n\n /**\n The `normalize` method is used to convert a payload received from your\n external data source into the normalized form `store.push()` expects. You\n should override this method, munge the hash and return the normalized\n payload.\n Example:\n ```js\n Serializer.extend({\n normalize(modelClass, resourceHash) {\n let data = {\n id: resourceHash.id,\n type: modelClass.modelName,\n attributes: resourceHash\n };\n return { data: data };\n }\n })\n ```\n @method normalize\n @public\n @param {Model} typeClass\n @param {Object} hash\n @return {Object}\n */\n normalize(_typeClass, hash) {\n return hash;\n }\n}\nexport { Serializer as default };","import { getOwner } from '@ember/application';\nimport { warn } from '@ember/debug';\nimport { dasherize, singularize } from '@ember-data/request-utils/string';\nimport Serializer from \"./index.js\";\nimport { macroCondition, getGlobalConfig } from '@embroider/macros';\nfunction coerceId(id) {\n if (id === null || id === undefined || id === '') {\n return null;\n } else if (typeof id === 'string') {\n return id;\n } else if (typeof id === 'symbol') {\n return id.toString();\n } else {\n return String(id);\n }\n}\n\n/**\n * @module @ember-data/serializer/json\n */\nconst SOURCE_POINTER_REGEXP = /^\\/?data\\/(attributes|relationships)\\/(.*)/;\nconst SOURCE_POINTER_PRIMARY_REGEXP = /^\\/?data/;\nconst PRIMARY_ATTRIBUTE_KEY = 'base';\n\n/**\n *
\n
\n ⚠️ This is LEGACY documentation for a feature that is no longer encouraged to be used.\n If starting a new app or thinking of implementing a new adapter, consider writing a\n Handler instead to be used with the RequestManager\n
\n
\n\n In EmberData a Serializer is used to serialize and deserialize\n records when they are transferred in and out of an external source.\n This process involves normalizing property names, transforming\n attribute values and serializing relationships.\n\n By default, EmberData uses and recommends the `JSONAPISerializer`.\n\n `JSONSerializer` is useful for simpler or legacy backends that may\n not support the http://jsonapi.org/ spec.\n\n For example, given the following `User` model and JSON payload:\n\n ```app/models/user.js\n import Model, { attr, belongsTo, hasMany } from '@ember-data/model';\n\n export default class UserModel extends Model {\n @hasMany('user') friends;\n @belongsTo('location') house;\n\n @attr('string') name;\n }\n ```\n\n ```js\n {\n id: 1,\n name: 'Sebastian',\n friends: [3, 4],\n links: {\n house: '/houses/lefkada'\n }\n }\n ```\n\n `JSONSerializer` will normalize the JSON payload to the JSON API format that the\n Ember Data store expects.\n\n You can customize how JSONSerializer processes its payload by passing options in\n the `attrs` hash or by subclassing the `JSONSerializer` and overriding hooks:\n\n - To customize how a single record is normalized, use the `normalize` hook.\n - To customize how `JSONSerializer` normalizes the whole server response, use the\n `normalizeResponse` hook.\n - To customize how `JSONSerializer` normalizes a specific response from the server,\n use one of the many specific `normalizeResponse` hooks.\n - To customize how `JSONSerializer` normalizes your id, attributes or relationships,\n use the `extractId`, `extractAttributes` and `extractRelationships` hooks.\n\n The `JSONSerializer` normalization process follows these steps:\n\n 1. `normalizeResponse`\n - entry method to the serializer.\n 2. `normalizeCreateRecordResponse`\n - a `normalizeResponse` for a specific operation is called.\n 3. `normalizeSingleResponse`|`normalizeArrayResponse`\n - for methods like `createRecord` we expect a single record back, while for methods like `findAll` we expect multiple records back.\n 4. `normalize`\n - `normalizeArrayResponse` iterates and calls `normalize` for each of its records while `normalizeSingle`\n calls it once. This is the method you most likely want to subclass.\n 5. `extractId` | `extractAttributes` | `extractRelationships`\n - `normalize` delegates to these methods to\n turn the record payload into the JSON API format.\n\n @main @ember-data/serializer/json\n @class JSONSerializer\n @public\n @extends Serializer\n*/\nconst JSONSerializer = Serializer.extend({\n /**\n The `primaryKey` is used when serializing and deserializing\n data. Ember Data always uses the `id` property to store the id of\n the record. The external source may not always follow this\n convention. In these cases it is useful to override the\n `primaryKey` property to match the `primaryKey` of your external\n store.\n Example\n ```app/serializers/application.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class ApplicationSerializer extends JSONSerializer {\n primaryKey = '_id'\n }\n ```\n @property primaryKey\n @type {String}\n @public\n @default 'id'\n */\n primaryKey: 'id',\n /**\n The `attrs` object can be used to declare a simple mapping between\n property names on `Model` records and payload keys in the\n serialized JSON object representing the record. An object with the\n property `key` can also be used to designate the attribute's key on\n the response payload.\n Example\n ```app/models/person.js\n import Model, { attr } from '@ember-data/model';\n export default class PersonModel extends Model {\n @attr('string') firstName;\n @attr('string') lastName;\n @attr('string') occupation;\n @attr('boolean') admin;\n }\n ```\n ```app/serializers/person.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class PersonSerializer extends JSONSerializer {\n attrs = {\n admin: 'is_admin',\n occupation: { key: 'career' }\n }\n }\n ```\n You can also remove attributes and relationships by setting the `serialize`\n key to `false` in your mapping object.\n Example\n ```app/serializers/person.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class PostSerializer extends JSONSerializer {\n attrs = {\n admin: { serialize: false },\n occupation: { key: 'career' }\n }\n }\n ```\n When serialized:\n ```javascript\n {\n \"firstName\": \"Harry\",\n \"lastName\": \"Houdini\",\n \"career\": \"magician\"\n }\n ```\n Note that the `admin` is now not included in the payload.\n Setting `serialize` to `true` enforces serialization for hasMany\n relationships even if it's neither a many-to-many nor many-to-none\n relationship.\n @property attrs\n @public\n @type {Object}\n */\n mergedProperties: ['attrs'],\n /**\n Given a subclass of `Model` and a JSON object this method will\n iterate through each attribute of the `Model` and invoke the\n `Transform#deserialize` method on the matching property of the\n JSON object. This method is typically called after the\n serializer's `normalize` method.\n @method applyTransforms\n @private\n @param {Model} typeClass\n @param {Object} data The data to transform\n @return {Object} data The transformed data object\n */\n applyTransforms(typeClass, data) {\n const attributes = typeClass.attributes;\n typeClass.eachTransformedAttribute((key, typeClass) => {\n if (data[key] === undefined) {\n return;\n }\n const transform = this.transformFor(typeClass);\n const transformMeta = attributes.get(key);\n data[key] = transform.deserialize(data[key], transformMeta.options);\n });\n return data;\n },\n /**\n The `normalizeResponse` method is used to normalize a payload from the\n server to a JSON-API Document.\n http://jsonapi.org/format/#document-structure\n This method delegates to a more specific normalize method based on\n the `requestType`.\n To override this method with a custom one, make sure to call\n `return super.normalizeResponse(store, primaryModelClass, payload, id, requestType)` with your\n pre-processed data.\n Here's an example of using `normalizeResponse` manually:\n ```javascript\n socket.on('message', function(message) {\n let data = message.data;\n let modelClass = store.modelFor(data.modelName);\n let serializer = store.serializerFor(data.modelName);\n let normalized = serializer.normalizeSingleResponse(store, modelClass, data, data.id);\n store.push(normalized);\n });\n ```\n @since 1.13.0\n @method normalizeResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeResponse(store, primaryModelClass, payload, id, requestType) {\n switch (requestType) {\n case 'findRecord':\n return this.normalizeFindRecordResponse(...arguments);\n case 'queryRecord':\n return this.normalizeQueryRecordResponse(...arguments);\n case 'findAll':\n return this.normalizeFindAllResponse(...arguments);\n case 'findBelongsTo':\n return this.normalizeFindBelongsToResponse(...arguments);\n case 'findHasMany':\n return this.normalizeFindHasManyResponse(...arguments);\n case 'findMany':\n return this.normalizeFindManyResponse(...arguments);\n case 'query':\n return this.normalizeQueryResponse(...arguments);\n case 'createRecord':\n return this.normalizeCreateRecordResponse(...arguments);\n case 'deleteRecord':\n return this.normalizeDeleteRecordResponse(...arguments);\n case 'updateRecord':\n return this.normalizeUpdateRecordResponse(...arguments);\n }\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `findRecord`\n @since 1.13.0\n @method normalizeFindRecordResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeFindRecordResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeSingleResponse(...arguments);\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `queryRecord`\n @since 1.13.0\n @method normalizeQueryRecordResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeQueryRecordResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeSingleResponse(...arguments);\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `findAll`\n @since 1.13.0\n @method normalizeFindAllResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeFindAllResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeArrayResponse(...arguments);\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `findBelongsTo`\n @since 1.13.0\n @method normalizeFindBelongsToResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeFindBelongsToResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeSingleResponse(...arguments);\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `findHasMany`\n @since 1.13.0\n @method normalizeFindHasManyResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeFindHasManyResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeArrayResponse(...arguments);\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `findMany`\n @since 1.13.0\n @method normalizeFindManyResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeFindManyResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeArrayResponse(...arguments);\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `query`\n @since 1.13.0\n @method normalizeQueryResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeQueryResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeArrayResponse(...arguments);\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `createRecord`\n @since 1.13.0\n @method normalizeCreateRecordResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeCreateRecordResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeSaveResponse(...arguments);\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `deleteRecord`\n @since 1.13.0\n @method normalizeDeleteRecordResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeDeleteRecordResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeSaveResponse(...arguments);\n },\n /**\n Called by the default normalizeResponse implementation when the\n type of request is `updateRecord`\n @since 1.13.0\n @method normalizeUpdateRecordResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeUpdateRecordResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeSaveResponse(...arguments);\n },\n /**\n normalizeUpdateRecordResponse, normalizeCreateRecordResponse and\n normalizeDeleteRecordResponse delegate to this method by default.\n @since 1.13.0\n @method normalizeSaveResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeSaveResponse(store, primaryModelClass, payload, id, requestType) {\n return this.normalizeSingleResponse(...arguments);\n },\n /**\n normalizeQueryResponse and normalizeFindRecordResponse delegate to this\n method by default.\n @since 1.13.0\n @method normalizeSingleResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeSingleResponse(store, primaryModelClass, payload, id, requestType) {\n return this._normalizeResponse(store, primaryModelClass, payload, id, requestType, true);\n },\n /**\n normalizeQueryResponse, normalizeFindManyResponse, and normalizeFindHasManyResponse delegate\n to this method by default.\n @since 1.13.0\n @method normalizeArrayResponse\n @public\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @return {Object} JSON-API Document\n */\n normalizeArrayResponse(store, primaryModelClass, payload, id, requestType) {\n return this._normalizeResponse(store, primaryModelClass, payload, id, requestType, false);\n },\n /**\n @method _normalizeResponse\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @param {Boolean} isSingle\n @return {Object} JSON-API Document\n @private\n */\n _normalizeResponse(store, primaryModelClass, payload, id, requestType, isSingle) {\n const documentHash = {\n data: null,\n included: []\n };\n const meta = this.extractMeta(store, primaryModelClass, payload);\n if (meta) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('The `meta` returned from `extractMeta` has to be an object, not \"' + typeof meta + '\".');\n }\n })(typeof meta === 'object') : {};\n documentHash.meta = meta;\n }\n if (isSingle) {\n const {\n data,\n included\n } = this.normalize(primaryModelClass, payload);\n documentHash.data = data;\n if (included) {\n documentHash.included = included;\n }\n } else {\n const ret = new Array(payload.length);\n for (let i = 0, l = payload.length; i < l; i++) {\n const item = payload[i];\n const {\n data,\n included\n } = this.normalize(primaryModelClass, item);\n if (included) {\n documentHash.included = documentHash.included.concat(included);\n }\n ret[i] = data;\n }\n documentHash.data = ret;\n }\n return documentHash;\n },\n /**\n Normalizes a part of the JSON payload returned by\n the server. You should override this method, munge the hash\n and call super if you have generic normalization to do.\n It takes the type of the record that is being normalized\n (as a Model class), the property where the hash was\n originally found, and the hash to normalize.\n You can use this method, for example, to normalize underscored keys to camelized\n or other general-purpose normalizations.\n Example\n ```app/serializers/application.js\n import JSONSerializer from '@ember-data/serializer/json';\n import { underscore } from '/utils/string-utils';\n import { get } from '@ember/object';\n export default class ApplicationSerializer extends JSONSerializer {\n normalize(typeClass, hash) {\n let fields = typeClass.fields;\n fields.forEach(function(type, field) {\n let payloadField = underscore(field);\n if (field === payloadField) { return; }\n hash[field] = hash[payloadField];\n delete hash[payloadField];\n });\n return super.normalize(...arguments);\n }\n }\n ```\n @method normalize\n @public\n @param {Model} typeClass\n @param {Object} hash\n @return {Object}\n */\n normalize(modelClass, resourceHash) {\n let data = null;\n if (resourceHash) {\n this.normalizeUsingDeclaredMapping(modelClass, resourceHash);\n if (typeof resourceHash.links === 'object') {\n this.normalizeUsingDeclaredMapping(modelClass, resourceHash.links);\n }\n data = {\n id: this.extractId(modelClass, resourceHash),\n type: modelClass.modelName,\n attributes: this.extractAttributes(modelClass, resourceHash),\n relationships: this.extractRelationships(modelClass, resourceHash)\n };\n if (resourceHash.lid) {\n data.lid = resourceHash.lid;\n }\n this.applyTransforms(modelClass, data.attributes);\n }\n return {\n data\n };\n },\n /**\n Returns the resource's ID.\n @method extractId\n @public\n @param {Object} modelClass\n @param {Object} resourceHash\n @return {String}\n */\n extractId(modelClass, resourceHash) {\n const primaryKey = this.primaryKey;\n const id = resourceHash[primaryKey];\n return coerceId(id);\n },\n /**\n Returns the resource's attributes formatted as a JSON-API \"attributes object\".\n http://jsonapi.org/format/#document-resource-object-attributes\n @method extractAttributes\n @public\n @param {Object} modelClass\n @param {Object} resourceHash\n @return {Object}\n */\n extractAttributes(modelClass, resourceHash) {\n let attributeKey;\n const attributes = {};\n modelClass.eachAttribute(key => {\n attributeKey = this.keyForAttribute(key, 'deserialize');\n if (resourceHash[attributeKey] !== undefined) {\n attributes[key] = resourceHash[attributeKey];\n }\n });\n return attributes;\n },\n /**\n Returns a relationship formatted as a JSON-API \"relationship object\".\n http://jsonapi.org/format/#document-resource-object-relationships\n @method extractRelationship\n @public\n @param {Object} relationshipModelName\n @param {Object} relationshipHash\n @return {Object}\n */\n extractRelationship(relationshipModelName, relationshipHash) {\n if (!relationshipHash) {\n return null;\n }\n /*\n When `relationshipHash` is an object it usually means that the relationship\n is polymorphic. It could however also be embedded resources that the\n EmbeddedRecordsMixin has be able to process.\n */\n if (relationshipHash && typeof relationshipHash === 'object' && !Array.isArray(relationshipHash)) {\n if (relationshipHash.id) {\n relationshipHash.id = coerceId(relationshipHash.id);\n }\n const modelClass = this.store.modelFor(relationshipModelName);\n if (relationshipHash.type && !modelClass.fields.has('type')) {\n relationshipHash.type = this.modelNameFromPayloadKey(relationshipHash.type);\n }\n return relationshipHash;\n }\n return {\n id: coerceId(relationshipHash),\n type: dasherize(singularize(relationshipModelName))\n };\n },\n /**\n Returns a polymorphic relationship formatted as a JSON-API \"relationship object\".\n http://jsonapi.org/format/#document-resource-object-relationships\n `relationshipOptions` is a hash which contains more information about the\n polymorphic relationship which should be extracted:\n - `resourceHash` complete hash of the resource the relationship should be\n extracted from\n - `relationshipKey` key under which the value for the relationship is\n extracted from the resourceHash\n - `relationshipMeta` meta information about the relationship\n @method extractPolymorphicRelationship\n @public\n @param {Object} relationshipModelName\n @param {Object} relationshipHash\n @param {Object} relationshipOptions\n @return {Object}\n */\n extractPolymorphicRelationship(relationshipModelName, relationshipHash, relationshipOptions) {\n return this.extractRelationship(relationshipModelName, relationshipHash);\n },\n /**\n Returns the resource's relationships formatted as a JSON-API \"relationships object\".\n http://jsonapi.org/format/#document-resource-object-relationships\n @method extractRelationships\n @public\n @param {Object} modelClass\n @param {Object} resourceHash\n @return {Object}\n */\n extractRelationships(modelClass, resourceHash) {\n const relationships = {};\n modelClass.eachRelationship((key, relationshipMeta) => {\n let relationship = null;\n const relationshipKey = this.keyForRelationship(key, relationshipMeta.kind, 'deserialize');\n if (resourceHash[relationshipKey] !== undefined) {\n let data = null;\n const relationshipHash = resourceHash[relationshipKey];\n if (relationshipMeta.kind === 'belongsTo') {\n if (relationshipMeta.options.polymorphic) {\n // extracting a polymorphic belongsTo may need more information\n // than the type and the hash (which might only be an id) for the\n // relationship, hence we pass the key, resource and\n // relationshipMeta too\n data = this.extractPolymorphicRelationship(relationshipMeta.type, relationshipHash, {\n key,\n resourceHash,\n relationshipMeta\n });\n } else {\n data = this.extractRelationship(relationshipMeta.type, relationshipHash);\n }\n } else if (relationshipMeta.kind === 'hasMany') {\n if (relationshipHash) {\n data = new Array(relationshipHash.length);\n if (relationshipMeta.options.polymorphic) {\n for (let i = 0, l = relationshipHash.length; i < l; i++) {\n const item = relationshipHash[i];\n data[i] = this.extractPolymorphicRelationship(relationshipMeta.type, item, {\n key,\n resourceHash,\n relationshipMeta\n });\n }\n } else {\n for (let i = 0, l = relationshipHash.length; i < l; i++) {\n const item = relationshipHash[i];\n data[i] = this.extractRelationship(relationshipMeta.type, item);\n }\n }\n }\n }\n relationship = {\n data\n };\n }\n const linkKey = this.keyForLink(key, relationshipMeta.kind);\n if (resourceHash.links && resourceHash.links[linkKey] !== undefined) {\n const related = resourceHash.links[linkKey];\n relationship = relationship || {};\n relationship.links = {\n related\n };\n }\n if (relationship) {\n relationships[key] = relationship;\n }\n });\n return relationships;\n },\n /**\n Dasherizes the model name in the payload\n @method modelNameFromPayloadKey\n @public\n @param {String} key\n @return {String} the model's modelName\n */\n modelNameFromPayloadKey(key) {\n return dasherize(singularize(key));\n },\n /**\n @method normalizeRelationships\n @private\n */\n normalizeRelationships(typeClass, hash) {\n let payloadKey;\n if (this.keyForRelationship) {\n typeClass.eachRelationship((key, relationship) => {\n payloadKey = this.keyForRelationship(key, relationship.kind, 'deserialize');\n if (key === payloadKey) {\n return;\n }\n if (hash[payloadKey] === undefined) {\n return;\n }\n hash[key] = hash[payloadKey];\n delete hash[payloadKey];\n });\n }\n },\n /**\n @method normalizeUsingDeclaredMapping\n @private\n */\n normalizeUsingDeclaredMapping(modelClass, hash) {\n const attrs = this.attrs;\n let normalizedKey;\n let payloadKey;\n if (attrs) {\n for (const key in attrs) {\n normalizedKey = payloadKey = this._getMappedKey(key, modelClass);\n if (hash[payloadKey] === undefined) {\n continue;\n }\n if (modelClass.attributes.has(key)) {\n normalizedKey = this.keyForAttribute(key, 'deserialize');\n }\n if (modelClass.relationshipsByName.has(key)) {\n normalizedKey = this.keyForRelationship(key, modelClass, 'deserialize');\n }\n if (payloadKey !== normalizedKey) {\n hash[normalizedKey] = hash[payloadKey];\n delete hash[payloadKey];\n }\n }\n }\n },\n /**\n Looks up the property key that was set by the custom `attr` mapping\n passed to the serializer.\n @method _getMappedKey\n @private\n @param {String} key\n @return {String} key\n */\n _getMappedKey(key, modelClass) {\n warn('There is no attribute or relationship with the name `' + key + '` on `' + modelClass.modelName + '`. Check your serializers attrs hash.', modelClass.attributes.has(key) || modelClass.relationshipsByName.has(key), {\n id: 'ds.serializer.no-mapped-attrs-key'\n });\n const attrs = this.attrs;\n let mappedKey;\n if (attrs && attrs[key]) {\n mappedKey = attrs[key];\n //We need to account for both the { title: 'post_title' } and\n //{ title: { key: 'post_title' }} forms\n if (mappedKey.key) {\n mappedKey = mappedKey.key;\n }\n if (typeof mappedKey === 'string') {\n key = mappedKey;\n }\n }\n return key;\n },\n /**\n Check attrs.key.serialize property to inform if the `key`\n can be serialized\n @method _canSerialize\n @private\n @param {String} key\n @return {boolean} true if the key can be serialized\n */\n _canSerialize(key) {\n const attrs = this.attrs;\n return !attrs || !attrs[key] || attrs[key].serialize !== false;\n },\n /**\n When attrs.key.serialize is set to true then\n it takes priority over the other checks and the related\n attribute/relationship will be serialized\n @method _mustSerialize\n @private\n @param {String} key\n @return {boolean} true if the key must be serialized\n */\n _mustSerialize(key) {\n const attrs = this.attrs;\n return attrs && attrs[key] && attrs[key].serialize === true;\n },\n /**\n Check if the given hasMany relationship should be serialized\n By default only many-to-many and many-to-none relationships are serialized.\n This could be configured per relationship by Serializer's `attrs` object.\n @method shouldSerializeHasMany\n @public\n @param {Snapshot} snapshot\n @param {String} key\n @param {RelationshipSchema} relationship\n @return {boolean} true if the hasMany relationship should be serialized\n */\n shouldSerializeHasMany(snapshot, key, relationship) {\n const schema = this.store.modelFor(snapshot.modelName);\n const relationshipType = schema.determineRelationshipType(relationship, this.store);\n if (this._mustSerialize(key)) {\n return true;\n }\n return this._canSerialize(key) && (relationshipType === 'manyToNone' || relationshipType === 'manyToMany');\n },\n // SERIALIZE\n /**\n Called when a record is saved in order to convert the\n record into JSON.\n By default, it creates a JSON object with a key for\n each attribute and belongsTo relationship.\n For example, consider this model:\n ```app/models/comment.js\n import Model, { attr, belongsTo } from '@ember-data/model';\n export default class CommentModel extends Model {\n @attr title;\n @attr body;\n @belongsTo('user') author;\n }\n ```\n The default serialization would create a JSON object like:\n ```javascript\n {\n \"title\": \"Rails is unagi\",\n \"body\": \"Rails? Omakase? O_O\",\n \"author\": 12\n }\n ```\n By default, attributes are passed through as-is, unless\n you specified an attribute type (`attr('date')`). If\n you specify a transform, the JavaScript value will be\n serialized when inserted into the JSON hash.\n By default, belongs-to relationships are converted into\n IDs when inserted into the JSON hash.\n ## IDs\n `serialize` takes an options hash with a single option:\n `includeId`. If this option is `true`, `serialize` will,\n by default include the ID in the JSON object it builds.\n The adapter passes in `includeId: true` when serializing\n a record for `createRecord`, but not for `updateRecord`.\n ## Customization\n Your server may expect a different JSON format than the\n built-in serialization format.\n In that case, you can implement `serialize` yourself and\n return a JSON hash of your choosing.\n ```app/serializers/post.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class PostSerializer extends JSONSerializer {\n serialize(snapshot, options) {\n let json = {\n POST_TTL: snapshot.attr('title'),\n POST_BDY: snapshot.attr('body'),\n POST_CMS: snapshot.hasMany('comments', { ids: true })\n };\n if (options.includeId) {\n json.POST_ID_ = snapshot.id;\n }\n return json;\n }\n }\n ```\n ## Customizing an App-Wide Serializer\n If you want to define a serializer for your entire\n application, you'll probably want to use `eachAttribute`\n and `eachRelationship` on the record.\n ```app/serializers/application.js\n import JSONSerializer from '@ember-data/serializer/json';\n import { singularize } from '/utils/string-utils';\n export default class ApplicationSerializer extends JSONSerializer {\n serialize(snapshot, options) {\n let json = {};\n snapshot.eachAttribute((name) => {\n json[serverAttributeName(name)] = snapshot.attr(name);\n });\n snapshot.eachRelationship((name, relationship) => {\n if (relationship.kind === 'hasMany') {\n json[serverHasManyName(name)] = snapshot.hasMany(name, { ids: true });\n }\n });\n if (options.includeId) {\n json.ID_ = snapshot.id;\n }\n return json;\n }\n }\n function serverAttributeName(attribute) {\n return attribute.underscore().toUpperCase();\n }\n function serverHasManyName(name) {\n return serverAttributeName(singularize(name)) + \"_IDS\";\n }\n ```\n This serializer will generate JSON that looks like this:\n ```javascript\n {\n \"TITLE\": \"Rails is omakase\",\n \"BODY\": \"Yep. Omakase.\",\n \"COMMENT_IDS\": [ \"1\", \"2\", \"3\" ]\n }\n ```\n ## Tweaking the Default JSON\n If you just want to do some small tweaks on the default JSON,\n you can call `super.serialize` first and make the tweaks on\n the returned JSON.\n ```app/serializers/post.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class PostSerializer extends JSONSerializer {\n serialize(snapshot, options) {\n let json = super.serialize(...arguments);\n json.subject = json.title;\n delete json.title;\n return json;\n }\n }\n ```\n @method serialize\n @public\n @param {Snapshot} snapshot\n @param {Object} options\n @return {Object} json\n */\n serialize(snapshot, options) {\n const json = {};\n if (options && options.includeId) {\n const id = snapshot.id;\n if (id) {\n json[this.primaryKey] = id;\n }\n }\n snapshot.eachAttribute((key, attribute) => {\n this.serializeAttribute(snapshot, json, key, attribute);\n });\n snapshot.eachRelationship((key, relationship) => {\n if (relationship.kind === 'belongsTo') {\n this.serializeBelongsTo(snapshot, json, relationship);\n } else if (relationship.kind === 'hasMany') {\n this.serializeHasMany(snapshot, json, relationship);\n }\n });\n return json;\n },\n /**\n You can use this method to customize how a serialized record is added to the complete\n JSON hash to be sent to the server. By default the JSON Serializer does not namespace\n the payload and just sends the raw serialized JSON object.\n If your server expects namespaced keys, you should consider using the RESTSerializer.\n Otherwise you can override this method to customize how the record is added to the hash.\n The hash property should be modified by reference.\n For example, your server may expect underscored root objects.\n ```app/serializers/application.js\n import RESTSerializer from '@ember-data/serializer/rest';\n import { underscoren} from '/utils/string-utils';\n export default class ApplicationSerializer extends RESTSerializer {\n serializeIntoHash(data, type, snapshot, options) {\n let root = underscore(type.modelName);\n data[root] = this.serialize(snapshot, options);\n }\n }\n ```\n @method serializeIntoHash\n @public\n @param {Object} hash\n @param {Model} typeClass\n @param {Snapshot} snapshot\n @param {Object} options\n */\n serializeIntoHash(hash, typeClass, snapshot, options) {\n Object.assign(hash, this.serialize(snapshot, options));\n },\n /**\n `serializeAttribute` can be used to customize how `attr`\n properties are serialized\n For example if you wanted to ensure all your attributes were always\n serialized as properties on an `attributes` object you could\n write:\n ```app/serializers/application.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class ApplicationSerializer extends JSONSerializer {\n serializeAttribute(snapshot, json, key, attributes) {\n json.attributes = json.attributes || {};\n super.serializeAttribute(snapshot, json.attributes, key, attributes);\n }\n }\n ```\n @method serializeAttribute\n @public\n @param {Snapshot} snapshot\n @param {Object} json\n @param {String} key\n @param {Object} attribute\n */\n serializeAttribute(snapshot, json, key, attribute) {\n if (this._canSerialize(key)) {\n const type = attribute.type;\n let value = snapshot.attr(key);\n if (type) {\n const transform = this.transformFor(type);\n value = transform.serialize(value, attribute.options);\n }\n\n // if provided, use the mapping provided by `attrs` in\n // the serializer\n const schema = this.store.modelFor(snapshot.modelName);\n let payloadKey = this._getMappedKey(key, schema);\n if (payloadKey === key && this.keyForAttribute) {\n payloadKey = this.keyForAttribute(key, 'serialize');\n }\n json[payloadKey] = value;\n }\n },\n /**\n `serializeBelongsTo` can be used to customize how `belongsTo`\n properties are serialized.\n Example\n ```app/serializers/post.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class PostSerializer extends JSONSerializer {\n serializeBelongsTo(snapshot, json, relationship) {\n let key = relationship.name;\n let belongsTo = snapshot.belongsTo(key);\n key = this.keyForRelationship ? this.keyForRelationship(key, \"belongsTo\", \"serialize\") : key;\n json[key] = !belongsTo ? null : belongsTo.record.toJSON();\n }\n }\n ```\n @method serializeBelongsTo\n @public\n @param {Snapshot} snapshot\n @param {Object} json\n @param {Object} relationship\n */\n serializeBelongsTo(snapshot, json, relationship) {\n const name = relationship.name;\n if (this._canSerialize(name)) {\n const belongsToId = snapshot.belongsTo(name, {\n id: true\n });\n\n // if provided, use the mapping provided by `attrs` in\n // the serializer\n const schema = this.store.modelFor(snapshot.modelName);\n let payloadKey = this._getMappedKey(name, schema);\n if (payloadKey === name && this.keyForRelationship) {\n payloadKey = this.keyForRelationship(name, 'belongsTo', 'serialize');\n }\n\n //Need to check whether the id is there for new&async records\n if (!belongsToId) {\n json[payloadKey] = null;\n } else {\n json[payloadKey] = belongsToId;\n }\n if (relationship.options.polymorphic) {\n this.serializePolymorphicType(snapshot, json, relationship);\n }\n }\n },\n /**\n `serializeHasMany` can be used to customize how `hasMany`\n properties are serialized.\n Example\n ```app/serializers/post.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class PostSerializer extends JSONSerializer {\n serializeHasMany(snapshot, json, relationship) {\n let key = relationship.name;\n if (key === 'comments') {\n return;\n } else {\n super.serializeHasMany(...arguments);\n }\n }\n }\n ```\n @method serializeHasMany\n @public\n @param {Snapshot} snapshot\n @param {Object} json\n @param {Object} relationship\n */\n serializeHasMany(snapshot, json, relationship) {\n const name = relationship.name;\n if (this.shouldSerializeHasMany(snapshot, name, relationship)) {\n const hasMany = snapshot.hasMany(name, {\n ids: true\n });\n if (hasMany !== undefined) {\n // if provided, use the mapping provided by `attrs` in\n // the serializer\n const schema = this.store.modelFor(snapshot.modelName);\n let payloadKey = this._getMappedKey(name, schema);\n if (payloadKey === name && this.keyForRelationship) {\n payloadKey = this.keyForRelationship(name, 'hasMany', 'serialize');\n }\n json[payloadKey] = hasMany;\n // TODO support for polymorphic manyToNone and manyToMany relationships\n }\n }\n },\n /**\n You can use this method to customize how polymorphic objects are\n serialized. Objects are considered to be polymorphic if\n `{ polymorphic: true }` is pass as the second argument to the\n `belongsTo` function.\n Example\n ```app/serializers/comment.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class CommentSerializer extends JSONSerializer {\n serializePolymorphicType(snapshot, json, relationship) {\n let key = relationship.name;\n let belongsTo = snapshot.belongsTo(key);\n key = this.keyForAttribute ? this.keyForAttribute(key, 'serialize') : key;\n if (!belongsTo) {\n json[key + '_type'] = null;\n } else {\n json[key + '_type'] = belongsTo.modelName;\n }\n }\n }\n ```\n @method serializePolymorphicType\n @public\n @param {Snapshot} snapshot\n @param {Object} json\n @param {Object} relationship\n */\n serializePolymorphicType() {},\n /**\n `extractMeta` is used to deserialize any meta information in the\n adapter payload. By default Ember Data expects meta information to\n be located on the `meta` property of the payload object.\n Example\n ```app/serializers/post.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class PostSerializer extends JSONSerializer {\n extractMeta(store, typeClass, payload) {\n if (payload && payload.hasOwnProperty('_pagination')) {\n let meta = payload._pagination;\n delete payload._pagination;\n return meta;\n }\n }\n }\n ```\n @method extractMeta\n @public\n @param {Store} store\n @param {Model} modelClass\n @param {Object} payload\n */\n extractMeta(store, modelClass, payload) {\n if (payload && payload['meta'] !== undefined) {\n const meta = payload.meta;\n delete payload.meta;\n return meta;\n }\n },\n /**\n `extractErrors` is used to extract model errors when a call\n to `Model#save` fails with an `InvalidError`. By default\n Ember Data expects error information to be located on the `errors`\n property of the payload object.\n This serializer expects this `errors` object to be an Array similar\n to the following, compliant with the https://jsonapi.org/format/#errors specification:\n ```js\n {\n \"errors\": [\n {\n \"detail\": \"This username is already taken!\",\n \"source\": {\n \"pointer\": \"data/attributes/username\"\n }\n }, {\n \"detail\": \"Doesn't look like a valid email.\",\n \"source\": {\n \"pointer\": \"data/attributes/email\"\n }\n }\n ]\n }\n ```\n The key `detail` provides a textual description of the problem.\n Alternatively, the key `title` can be used for the same purpose.\n The nested keys `source.pointer` detail which specific element\n of the request data was invalid.\n Note that JSON-API also allows for object-level errors to be placed\n in an object with pointer `data`, signifying that the problem\n cannot be traced to a specific attribute:\n ```javascript\n {\n \"errors\": [\n {\n \"detail\": \"Some generic non property error message\",\n \"source\": {\n \"pointer\": \"data\"\n }\n }\n ]\n }\n ```\n When turn into a `Errors` object, you can read these errors\n through the property `base`:\n ```handlebars\n {{#each @model.errors.base as |error|}}\n
\n {{error.message}}\n
\n {{/each}}\n ```\n Example of alternative implementation, overriding the default\n behavior to deal with a different format of errors:\n ```app/serializers/post.js\n import JSONSerializer from '@ember-data/serializer/json';\n export default class PostSerializer extends JSONSerializer {\n extractErrors(store, typeClass, payload, id) {\n if (payload && typeof payload === 'object' && payload._problems) {\n payload = payload._problems;\n this.normalizeErrors(typeClass, payload);\n }\n return payload;\n }\n }\n ```\n @method extractErrors\n @public\n @param {Store} store\n @param {Model} typeClass\n @param {Object} payload\n @param {(String|Number)} id\n @return {Object} json The deserialized errors\n */\n extractErrors(store, typeClass, payload, id) {\n if (payload && typeof payload === 'object' && payload.errors) {\n // the default assumption is that errors is already in JSON:API format\n const extracted = {};\n payload.errors.forEach(error => {\n if (error.source && error.source.pointer) {\n let key = error.source.pointer.match(SOURCE_POINTER_REGEXP);\n if (key) {\n key = key[2];\n } else if (error.source.pointer.search(SOURCE_POINTER_PRIMARY_REGEXP) !== -1) {\n key = PRIMARY_ATTRIBUTE_KEY;\n }\n if (key) {\n extracted[key] = extracted[key] || [];\n extracted[key].push(error.detail || error.title);\n }\n }\n });\n\n // if the user has an attrs hash, convert keys using it\n this.normalizeUsingDeclaredMapping(typeClass, extracted);\n\n // for each attr and relationship, make sure that we use\n // the normalized key\n typeClass.eachAttribute(name => {\n const key = this.keyForAttribute(name, 'deserialize');\n if (key !== name && extracted[key] !== undefined) {\n extracted[name] = extracted[key];\n delete extracted[key];\n }\n });\n typeClass.eachRelationship(name => {\n const key = this.keyForRelationship(name, 'deserialize');\n if (key !== name && extracted[key] !== undefined) {\n extracted[name] = extracted[key];\n delete extracted[key];\n }\n });\n return extracted;\n }\n return payload;\n },\n /**\n `keyForAttribute` can be used to define rules for how to convert an\n attribute name in your model to a key in your JSON.\n Example\n ```app/serializers/application.js\n import JSONSerializer from '@ember-data/serializer/json';\n import { underscore } from '/utils/string-utils';\n export default class ApplicationSerializer extends JSONSerializer {\n keyForAttribute(attr, method) {\n return underscore(attr).toUpperCase();\n }\n }\n ```\n @method keyForAttribute\n @public\n @param {String} key\n @param {String} method\n @return {String} normalized key\n */\n keyForAttribute(key, method) {\n return key;\n },\n /**\n `keyForRelationship` can be used to define a custom key when\n serializing and deserializing relationship properties. By default\n `JSONSerializer` does not provide an implementation of this method.\n Example\n ```app/serializers/post.js\n import JSONSerializer from '@ember-data/serializer/json';\n import { underscore } from '/utils/string-utils';\n export default class PostSerializer extends JSONSerializer {\n keyForRelationship(key, relationship, method) {\n return `rel_${underscore(key)}`;\n }\n }\n ```\n @method keyForRelationship\n @public\n @param {String} key\n @param {String} typeClass\n @param {String} method\n @return {String} normalized key\n */\n keyForRelationship(key, typeClass, method) {\n return key;\n },\n /**\n `keyForLink` can be used to define a custom key when deserializing link\n properties.\n @method keyForLink\n @public\n @param {String} key\n @param {String} kind `belongsTo` or `hasMany`\n @return {String} normalized key\n */\n keyForLink(key, kind) {\n return key;\n },\n // HELPERS\n\n /**\n @method transformFor\n @private\n @param {String} attributeType\n @param {Boolean} skipAssertion\n @return {Transform} transform\n */\n transformFor(attributeType, skipAssertion) {\n const transform = getOwner(this).lookup('transform:' + attributeType);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Unable to find the transform for \\`attr('${attributeType}')\\``);\n }\n })(skipAssertion || !!transform) : {};\n return transform;\n }\n});\nexport { JSONSerializer as J, coerceId as c };","import { warn } from '@ember/debug';\nimport { dasherize, singularize, pluralize } from '@ember-data/request-utils/string';\nimport { J as JSONSerializer } from \"./json-BwMH6O_R.js\";\nimport { macroCondition, getGlobalConfig } from '@embroider/macros';\n\n/**\n * @module @ember-data/serializer/json-api\n */\nconst JSONAPISerializer = JSONSerializer.extend({\n /**\n @method _normalizeDocumentHelper\n @param {Object} documentHash\n @return {Object}\n @private\n */\n _normalizeDocumentHelper(documentHash) {\n if (Array.isArray(documentHash.data)) {\n const ret = new Array(documentHash.data.length);\n for (let i = 0; i < documentHash.data.length; i++) {\n const data = documentHash.data[i];\n ret[i] = this._normalizeResourceHelper(data);\n }\n documentHash.data = ret;\n } else if (documentHash.data && typeof documentHash.data === 'object') {\n documentHash.data = this._normalizeResourceHelper(documentHash.data);\n }\n if (Array.isArray(documentHash.included)) {\n const ret = new Array();\n for (let i = 0; i < documentHash.included.length; i++) {\n const included = documentHash.included[i];\n const normalized = this._normalizeResourceHelper(included);\n if (normalized !== null) {\n // can be null when unknown type is encountered\n ret.push(normalized);\n }\n }\n documentHash.included = ret;\n }\n return documentHash;\n },\n /**\n @method _normalizeRelationshipDataHelper\n @param {Object} relationshipDataHash\n @return {Object}\n @private\n */\n _normalizeRelationshipDataHelper(relationshipDataHash) {\n relationshipDataHash.type = this.modelNameFromPayloadKey(relationshipDataHash.type);\n return relationshipDataHash;\n },\n /**\n @method _normalizeResourceHelper\n @param {Object} resourceHash\n @return {Object}\n @private\n */\n _normalizeResourceHelper(resourceHash) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(this.warnMessageForUndefinedType());\n }\n })(resourceHash.type) : {};\n const type = this.modelNameFromPayloadKey(resourceHash.type);\n if (!this.store.schema.hasResource({\n type\n })) {\n warn(this.warnMessageNoModelForType(type, resourceHash.type, 'modelNameFromPayloadKey'), false, {\n id: 'ds.serializer.model-for-type-missing'\n });\n return null;\n }\n const modelClass = this.store.modelFor(type);\n const serializer = this.store.serializerFor(type);\n const {\n data\n } = serializer.normalize(modelClass, resourceHash);\n return data;\n },\n /**\n Normalize some data and push it into the store.\n @method pushPayload\n @public\n @param {Store} store\n @param {Object} payload\n */\n pushPayload(store, payload) {\n const normalizedPayload = this._normalizeDocumentHelper(payload);\n store.push(normalizedPayload);\n },\n /**\n @method _normalizeResponse\n @param {Store} store\n @param {Model} primaryModelClass\n @param {Object} payload\n @param {String|Number} id\n @param {String} requestType\n @param {Boolean} isSingle\n @return {Object} JSON-API Document\n @private\n */\n _normalizeResponse(store, primaryModelClass, payload, id, requestType, isSingle) {\n const normalizedPayload = this._normalizeDocumentHelper(payload);\n return normalizedPayload;\n },\n normalizeQueryRecordResponse() {\n const normalized = this._super(...arguments);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('Expected the primary data returned by the serializer for a `queryRecord` response to be a single object but instead it was an array.');\n }\n })(!Array.isArray(normalized.data)) : {};\n return normalized;\n },\n extractAttributes(modelClass, resourceHash) {\n const attributes = {};\n if (resourceHash.attributes) {\n modelClass.eachAttribute(key => {\n const attributeKey = this.keyForAttribute(key, 'deserialize');\n if (resourceHash.attributes[attributeKey] !== undefined) {\n attributes[key] = resourceHash.attributes[attributeKey];\n }\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (resourceHash.attributes[attributeKey] === undefined && resourceHash.attributes[key] !== undefined) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`Your payload for '${modelClass.modelName}' contains '${key}', but your serializer is setup to look for '${attributeKey}'. This is most likely because Ember Data's JSON API serializer dasherizes attribute keys by default. You should subclass JSONAPISerializer and implement 'keyForAttribute(key) { return key; }' to prevent Ember Data from customizing your attribute keys.`);\n }\n })() : {};\n }\n }\n });\n }\n return attributes;\n },\n /**\n Returns a relationship formatted as a JSON-API \"relationship object\".\n http://jsonapi.org/format/#document-resource-object-relationships\n @method extractRelationship\n @public\n @param {Object} relationshipHash\n @return {Object}\n */\n extractRelationship(relationshipHash) {\n if (Array.isArray(relationshipHash.data)) {\n const ret = new Array(relationshipHash.data.length);\n for (let i = 0; i < relationshipHash.data.length; i++) {\n const data = relationshipHash.data[i];\n ret[i] = this._normalizeRelationshipDataHelper(data);\n }\n relationshipHash.data = ret;\n } else if (relationshipHash.data && typeof relationshipHash.data === 'object') {\n relationshipHash.data = this._normalizeRelationshipDataHelper(relationshipHash.data);\n }\n return relationshipHash;\n },\n /**\n Returns the resource's relationships formatted as a JSON-API \"relationships object\".\n http://jsonapi.org/format/#document-resource-object-relationships\n @method extractRelationships\n @public\n @param {Object} modelClass\n @param {Object} resourceHash\n @return {Object}\n */\n extractRelationships(modelClass, resourceHash) {\n const relationships = {};\n if (resourceHash.relationships) {\n modelClass.eachRelationship((key, relationshipMeta) => {\n const relationshipKey = this.keyForRelationship(key, relationshipMeta.kind, 'deserialize');\n if (resourceHash.relationships[relationshipKey] !== undefined) {\n const relationshipHash = resourceHash.relationships[relationshipKey];\n relationships[key] = this.extractRelationship(relationshipHash);\n }\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (resourceHash.relationships[relationshipKey] === undefined && resourceHash.relationships[key] !== undefined) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`Your payload for '${modelClass.modelName}' contains '${key}', but your serializer is setup to look for '${relationshipKey}'. This is most likely because Ember Data's JSON API serializer dasherizes relationship keys by default. You should subclass JSONAPISerializer and implement 'keyForRelationship(key) { return key; }' to prevent Ember Data from customizing your relationship keys.`);\n }\n })() : {};\n }\n }\n });\n }\n return relationships;\n },\n /**\n @method _extractType\n @param {Model} modelClass\n @param {Object} resourceHash\n @return {String}\n @private\n */\n _extractType(modelClass, resourceHash) {\n return this.modelNameFromPayloadKey(resourceHash.type);\n },\n /**\n Dasherizes and singularizes the model name in the payload to match\n the format Ember Data uses internally for the model name.\n For example the key `posts` would be converted to `post` and the\n key `studentAssesments` would be converted to `student-assesment`.\n @method modelNameFromPayloadKey\n @public\n @param {String} key\n @return {String} the model's modelName\n */\n modelNameFromPayloadKey(key) {\n return dasherize(singularize(key));\n },\n /**\n Converts the model name to a pluralized version of the model name.\n For example `post` would be converted to `posts` and\n `student-assesment` would be converted to `student-assesments`.\n @method payloadKeyFromModelName\n @public\n @param {String} modelName\n @return {String}\n */\n payloadKeyFromModelName(modelName) {\n return pluralize(modelName);\n },\n normalize(modelClass, resourceHash) {\n if (resourceHash.attributes) {\n this.normalizeUsingDeclaredMapping(modelClass, resourceHash.attributes);\n }\n if (resourceHash.relationships) {\n this.normalizeUsingDeclaredMapping(modelClass, resourceHash.relationships);\n }\n const data = {\n id: this.extractId(modelClass, resourceHash),\n type: this._extractType(modelClass, resourceHash),\n attributes: this.extractAttributes(modelClass, resourceHash),\n relationships: this.extractRelationships(modelClass, resourceHash)\n };\n if (resourceHash.lid) {\n data.lid = resourceHash.lid;\n }\n this.applyTransforms(modelClass, data.attributes);\n return {\n data\n };\n },\n /**\n `keyForAttribute` can be used to define rules for how to convert an\n attribute name in your model to a key in your JSON.\n By default `JSONAPISerializer` follows the format used on the examples of\n http://jsonapi.org/format and uses dashes as the word separator in the JSON\n attribute keys.\n This behaviour can be easily customized by extending this method.\n Example\n ```app/serializers/application.js\n import JSONAPISerializer from '@ember-data/serializer/json-api';\n import { dasherize } from '/utils/string-utils';\n export default class ApplicationSerializer extends JSONAPISerializer {\n keyForAttribute(attr, method) {\n return dasherize(attr).toUpperCase();\n }\n }\n ```\n @method keyForAttribute\n @public\n @param {String} key\n @param {String} method\n @return {String} normalized key\n */\n keyForAttribute(key, method) {\n return dasherize(key);\n },\n /**\n `keyForRelationship` can be used to define a custom key when\n serializing and deserializing relationship properties.\n By default `JSONAPISerializer` follows the format used on the examples of\n http://jsonapi.org/format and uses dashes as word separators in\n relationship properties.\n This behaviour can be easily customized by extending this method.\n Example\n ```app/serializers/post.js\n import JSONAPISerializer from '@ember-data/serializer/json-api';\n import { underscore } from '/utils/string-utils';\n export default class ApplicationSerializer extends JSONAPISerializer {\n keyForRelationship(key, relationship, method) {\n return underscore(key);\n }\n }\n ```\n @method keyForRelationship\n @public\n @param {String} key\n @param {String} typeClass\n @param {String} method\n @return {String} normalized key\n */\n keyForRelationship(key, typeClass, method) {\n return dasherize(key);\n },\n /**\n Called when a record is saved in order to convert the\n record into JSON.\n For example, consider this model:\n ```app/models/comment.js\n import Model, { attr, belongsTo } from '@ember-data/model';\n export default class CommentModel extends Model {\n @attr title;\n @attr body;\n @belongsTo('user', { async: false, inverse: null })\n author;\n }\n ```\n The default serialization would create a JSON-API resource object like:\n ```javascript\n {\n \"data\": {\n \"type\": \"comments\",\n \"attributes\": {\n \"title\": \"Rails is unagi\",\n \"body\": \"Rails? Omakase? O_O\",\n },\n \"relationships\": {\n \"author\": {\n \"data\": {\n \"id\": \"12\",\n \"type\": \"users\"\n }\n }\n }\n }\n }\n ```\n By default, attributes are passed through as-is, unless\n you specified an attribute type (`attr('date')`). If\n you specify a transform, the JavaScript value will be\n serialized when inserted into the attributes hash.\n Belongs-to relationships are converted into JSON-API\n resource identifier objects.\n ## IDs\n `serialize` takes an options hash with a single option:\n `includeId`. If this option is `true`, `serialize` will,\n by default include the ID in the JSON object it builds.\n The JSONAPIAdapter passes in `includeId: true` when serializing a record\n for `createRecord` or `updateRecord`.\n ## Customization\n Your server may expect data in a different format than the\n built-in serialization format.\n In that case, you can implement `serialize` yourself and\n return data formatted to match your API's expectations, or override\n the invoked adapter method and do the serialization in the adapter directly\n by using the provided snapshot.\n If your API's format differs greatly from the JSON:API spec, you should\n consider authoring your own adapter and serializer instead of extending\n this class.\n ```app/serializers/post.js\n import JSONAPISerializer from '@ember-data/serializer/json-api';\n export default class PostSerializer extends JSONAPISerializer {\n serialize(snapshot, options) {\n let json = {\n POST_TTL: snapshot.attr('title'),\n POST_BDY: snapshot.attr('body'),\n POST_CMS: snapshot.hasMany('comments', { ids: true })\n };\n if (options.includeId) {\n json.POST_ID_ = snapshot.id;\n }\n return json;\n }\n }\n ```\n ## Customizing an App-Wide Serializer\n If you want to define a serializer for your entire\n application, you'll probably want to use `eachAttribute`\n and `eachRelationship` on the record.\n ```app/serializers/application.js\n import JSONAPISerializer from '@ember-data/serializer/json-api';\n import { underscore, singularize } from '/utils/string-utils';\n export default class ApplicationSerializer extends JSONAPISerializer {\n serialize(snapshot, options) {\n let json = {};\n snapshot.eachAttribute((name) => {\n json[serverAttributeName(name)] = snapshot.attr(name);\n });\n snapshot.eachRelationship((name, relationship) => {\n if (relationship.kind === 'hasMany') {\n json[serverHasManyName(name)] = snapshot.hasMany(name, { ids: true });\n }\n });\n if (options.includeId) {\n json.ID_ = snapshot.id;\n }\n return json;\n }\n }\n function serverAttributeName(attribute) {\n return underscore(attribute).toUpperCase();\n }\n function serverHasManyName(name) {\n return serverAttributeName(singularize(name)) + '_IDS';\n }\n ```\n This serializer will generate JSON that looks like this:\n ```javascript\n {\n \"TITLE\": \"Rails is omakase\",\n \"BODY\": \"Yep. Omakase.\",\n \"COMMENT_IDS\": [ \"1\", \"2\", \"3\" ]\n }\n ```\n ## Tweaking the Default Formatting\n If you just want to do some small tweaks on the default JSON:API formatted response,\n you can call `super.serialize` first and make the tweaks\n on the returned object.\n ```app/serializers/post.js\n import JSONAPISerializer from '@ember-data/serializer/json-api';\n export default class PostSerializer extends JSONAPISerializer {\n serialize(snapshot, options) {\n let json = super.serialize(...arguments);\n json.data.attributes.subject = json.data.attributes.title;\n delete json.data.attributes.title;\n return json;\n }\n }\n ```\n @method serialize\n @public\n @param {Snapshot} snapshot\n @param {Object} options\n @return {Object} json\n */\n serialize(snapshot, options) {\n const data = this._super(...arguments);\n data.type = this.payloadKeyFromModelName(snapshot.modelName);\n return {\n data\n };\n },\n serializeAttribute(snapshot, json, key, attribute) {\n const type = attribute.type;\n if (this._canSerialize(key)) {\n json.attributes = json.attributes || {};\n let value = snapshot.attr(key);\n if (type) {\n const transform = this.transformFor(type);\n value = transform.serialize(value, attribute.options);\n }\n const schema = this.store.modelFor(snapshot.modelName);\n let payloadKey = this._getMappedKey(key, schema);\n if (payloadKey === key) {\n payloadKey = this.keyForAttribute(key, 'serialize');\n }\n json.attributes[payloadKey] = value;\n }\n },\n serializeBelongsTo(snapshot, json, relationship) {\n const name = relationship.name;\n if (this._canSerialize(name)) {\n const belongsTo = snapshot.belongsTo(name);\n const belongsToIsNotNew = belongsTo && !belongsTo.isNew;\n if (belongsTo === null || belongsToIsNotNew) {\n json.relationships = json.relationships || {};\n const schema = this.store.modelFor(snapshot.modelName);\n let payloadKey = this._getMappedKey(name, schema);\n if (payloadKey === name) {\n payloadKey = this.keyForRelationship(name, 'belongsTo', 'serialize');\n }\n let data = null;\n if (belongsTo) {\n const payloadType = this.payloadKeyFromModelName(belongsTo.modelName);\n data = {\n type: payloadType,\n id: belongsTo.id\n };\n }\n json.relationships[payloadKey] = {\n data\n };\n }\n }\n },\n serializeHasMany(snapshot, json, relationship) {\n const name = relationship.name;\n if (this.shouldSerializeHasMany(snapshot, name, relationship)) {\n const hasMany = snapshot.hasMany(name);\n if (hasMany !== undefined) {\n json.relationships = json.relationships || {};\n const schema = this.store.modelFor(snapshot.modelName);\n let payloadKey = this._getMappedKey(name, schema);\n if (payloadKey === name && this.keyForRelationship) {\n payloadKey = this.keyForRelationship(name, 'hasMany', 'serialize');\n }\n\n // only serialize has many relationships that are not new\n const nonNewHasMany = hasMany.filter(item => !item.isNew);\n const data = new Array(nonNewHasMany.length);\n for (let i = 0; i < nonNewHasMany.length; i++) {\n const item = hasMany[i];\n const payloadType = this.payloadKeyFromModelName(item.modelName);\n data[i] = {\n type: payloadType,\n id: item.id\n };\n }\n json.relationships[payloadKey] = {\n data\n };\n }\n }\n }\n});\nif (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n JSONAPISerializer.reopen({\n init(...args) {\n this._super(...args);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You've used the EmbeddedRecordsMixin in ${this.toString()} which is not fully compatible with the JSON:API specification. Please confirm that this works for your specific API and add \\`this.isEmbeddedRecordsMixinCompatible = true\\` to your serializer.`);\n }\n })(!this.isEmbeddedRecordsMixin || this.isEmbeddedRecordsMixinCompatible === true) : {};\n const constructor = this.constructor;\n warn(`You've defined 'extractMeta' in ${constructor.toString()} which is not used for serializers extending JSONAPISerializer. Read more at https://api.emberjs.com/ember-data/release/classes/JSONAPISerializer on how to customize meta when using JSON API.`, this.extractMeta === JSONSerializer.prototype.extractMeta, {\n id: 'ds.serializer.json-api.extractMeta'\n });\n },\n warnMessageForUndefinedType() {\n return 'Encountered a resource object with an undefined type (resolved resource using ' + this.constructor.toString() + ')';\n },\n warnMessageNoModelForType(modelName, originalType, usedLookup) {\n return `Encountered a resource object with type \"${originalType}\", but no model was found for model name \"${modelName}\" (resolved model name using '${this.constructor.toString()}.${usedLookup}(\"${originalType}\")').`;\n }\n });\n}\nexport { JSONAPISerializer as default };","import EmberObject from '@ember/object';\nimport { TransformName } from '@warp-drive/core-types/symbols';\n\n/**\n @module @ember-data/serializer\n*/\n\n/**\n The `Transform` class is used to serialize and deserialize model\n attributes when they are saved or loaded from an\n adapter. Subclassing `Transform` is useful for creating custom\n attributes. All subclasses of `Transform` must implement a\n `serialize` and a `deserialize` method.\n\n Example\n\n ```app/transforms/temperature.js\n\n // Converts centigrade in the JSON to fahrenheit in the app\n export default class TemperatureTransform {\n deserialize(serialized, options) {\n return (serialized * 1.8) + 32;\n }\n\n serialize(deserialized, options) {\n return (deserialized - 32) / 1.8;\n }\n\n static create() {\n return new this();\n }\n }\n ```\n\n Usage\n\n ```app/models/requirement.js\n import Model, { attr } from '@ember-data/model';\n\n export default class RequirementModel extends Model {\n @attr('string') name;\n @attr('temperature') temperature;\n }\n ```\n\n The options passed into the `attr` function when the attribute is\n declared on the model is also available in the transform.\n\n ```app/models/post.js\n import Model, { attr } from '@ember-data/model';\n\n export default class PostModel extends Model {\n @attr('string') title;\n @attr('markdown', {\n markdown: {\n gfm: false,\n sanitize: true\n }\n })\n markdown;\n }\n ```\n\n ```app/transforms/markdown.js\n export default class MarkdownTransform {\n serialize(deserialized, options) {\n return deserialized.raw;\n }\n\n deserialize(serialized, options) {\n let markdownOptions = options.markdown || {};\n\n return marked(serialized, markdownOptions);\n }\n\n static create() {\n return new this();\n }\n }\n ```\n\n @class Transform\n @public\n */\n/**\n When given a deserialized value from a record attribute this\n method must return the serialized value.\n\n Example\n\n ```javascript\n serialize(deserialized, options) {\n return deserialized ? null : Number(deserialized);\n }\n ```\n\n @method serialize\n @public\n @param deserialized The deserialized value\n @param options hash of options passed to `attr`\n @return The serialized value\n*/\n/**\n When given a serialized value from a JSON object this method must\n return the deserialized value for the record attribute.\n\n Example\n\n ```javascript\n deserialize(serialized, options) {\n return empty(serialized) ? null : Number(serialized);\n }\n ```\n\n @method deserialize\n @public\n @param serialized The serialized value\n @param options hash of options passed to `attr`\n @return The deserialized value\n*/\n\nconst Transform = EmberObject;\n\n/**\n @module @ember-data/serializer\n*/\n\n/**\n The `BooleanTransform` class is used to serialize and deserialize\n boolean attributes on Ember Data record objects. This transform is\n used when `boolean` is passed as the type parameter to the\n [attr](/ember-data/release/functions/@ember-data%2Fmodel/attr) function.\n\n Usage\n\n ```app/models/user.js\n import Model, { attr } from '@ember-data/model';\n\n export default class UserModel extends Model {\n @attr('boolean') isAdmin;\n @attr('string') name;\n @attr('string') email;\n }\n ```\n\n By default, the boolean transform only allows for values of `true` or\n `false`. You can opt into allowing `null` values for\n boolean attributes via `attr('boolean', { allowNull: true })`\n\n ```app/models/user.js\n import Model, { attr } from '@ember-data/model';\n\n export default class UserModel extends Model {\n @attr('string') email;\n @attr('string') username;\n @attr('boolean', { allowNull: true }) wantsWeeklyEmail;\n }\n ```\n\n @class BooleanTransform\n @public\n */\nclass BooleanTransform {\n deserialize(serialized, options) {\n if ((serialized === null || serialized === undefined) && options?.allowNull === true) {\n return null;\n }\n if (typeof serialized === 'boolean') {\n return serialized;\n } else if (typeof serialized === 'string') {\n return /^(true|t|1)$/i.test(serialized);\n } else if (typeof serialized === 'number') {\n return serialized === 1;\n } else {\n return false;\n }\n }\n serialize(deserialized, options) {\n if ((deserialized === null || deserialized === undefined) && options?.allowNull === true) {\n return null;\n }\n return Boolean(deserialized);\n }\n [TransformName] = 'boolean';\n static create() {\n return new this();\n }\n}\n\n/**\n @module @ember-data/serializer\n*/\n\n/**\n The `DateTransform` class is used to serialize and deserialize\n date attributes on Ember Data record objects. This transform is used\n when `date` is passed as the type parameter to the\n [attr](/ember-data/release/functions/@ember-data%2Fmodel/attr) function. It uses the [`ISO 8601`](https://en.wikipedia.org/wiki/ISO_8601)\n standard.\n\n ```app/models/score.js\n import Model, { attr, belongsTo } from '@ember-data/model';\n\n export default class ScoreModel extends Model {\n @attr('number') value;\n @belongsTo('player') player;\n @attr('date') date;\n }\n ```\n\n @class DateTransform\n @public\n */\n\nclass DateTransform {\n deserialize(serialized, _options) {\n if (typeof serialized === 'string') {\n let offset = serialized.indexOf('+');\n if (offset !== -1 && serialized.length - 5 === offset) {\n offset += 3;\n return new Date(serialized.slice(0, offset) + ':' + serialized.slice(offset));\n }\n return new Date(serialized);\n } else if (typeof serialized === 'number') {\n return new Date(serialized);\n } else if (serialized === null || serialized === undefined) {\n // if the value is null return null\n // if the value is not present in the data return undefined\n return serialized;\n } else {\n return null;\n }\n }\n serialize(date, _options) {\n // @ts-expect-error isNaN accepts date as it is coercible\n if (date instanceof Date && !isNaN(date)) {\n return date.toISOString();\n } else {\n return null;\n }\n }\n [TransformName] = 'date';\n static create() {\n return new this();\n }\n}\n\n/**\n @module @ember-data/serializer\n*/\n\nfunction isNumber(value) {\n return value === value && value !== Infinity && value !== -Infinity;\n}\n\n/**\n The `NumberTransform` class is used to serialize and deserialize\n numeric attributes on Ember Data record objects. This transform is\n used when `number` is passed as the type parameter to the\n [attr](/ember-data/release/functions/@ember-data%2Fmodel/attr) function.\n\n Usage\n\n ```app/models/score.js\n import Model, { attr, belongsTo } from '@ember-data/model';\n\n export default class ScoreModel extends Model {\n @attr('number') value;\n @belongsTo('player') player;\n @attr('date') date;\n }\n ```\n\n @class NumberTransform\n @public\n */\nclass NumberTransform {\n deserialize(serialized, _options) {\n if (serialized === '' || serialized === null || serialized === undefined) {\n return null;\n } else {\n const transformed = Number(serialized);\n return isNumber(transformed) ? transformed : null;\n }\n }\n serialize(deserialized, _options) {\n if (deserialized === '' || deserialized === null || deserialized === undefined) {\n return null;\n } else {\n const transformed = Number(deserialized);\n return isNumber(transformed) ? transformed : null;\n }\n }\n [TransformName] = 'number';\n static create() {\n return new this();\n }\n}\n\n/**\n @module @ember-data/serializer\n*/\n\n/**\n The `StringTransform` class is used to serialize and deserialize\n string attributes on Ember Data record objects. This transform is\n used when `string` is passed as the type parameter to the\n [attr](/ember-data/release/functions/@ember-data%2Fmodel/attr) function.\n\n Usage\n\n ```app/models/user.js\n import Model, { attr, belongsTo } from '@ember-data/model';\n\n export default class UserModel extends Model {\n @attr('boolean') isAdmin;\n @attr('string') name;\n @attr('string') email;\n }\n ```\n\n @class StringTransform\n @public\n */\nclass StringTransform {\n deserialize(serialized, _options) {\n return !serialized && serialized !== '' ? null : String(serialized);\n }\n serialize(deserialized, _options) {\n return !deserialized && deserialized !== '' ? null : String(deserialized);\n }\n [TransformName] = 'string';\n static create() {\n return new this();\n }\n}\nexport { BooleanTransform, DateTransform, NumberTransform, StringTransform, Transform as default };","/**\n @module @ember-data/store\n*/\n\n// provided for additional debuggability\nconst DEBUG_CLIENT_ORIGINATED = Symbol('record-originated-on-client');\nconst DEBUG_IDENTIFIER_BUCKET = Symbol('identifier-bucket');\nconst DEBUG_STALE_CACHE_OWNER = Symbol('warpDriveStaleCache');\n\n// also present in production\nconst CACHE_OWNER = Symbol('warpDriveCache');\n\n/**\n * An Identifier specific to a record which may or may not\n * be present in the cache.\n *\n * The absence of an `id` DOES NOT indicate that this\n * Identifier is for a new client-created record as it\n * may also indicate that it was generated for a secondary\n * index and the primary `id` index is not yet known.\n *\n * @internal\n */\n\n/**\n * Used when an Identifier is known to be the stable version\n *\n * @internal\n */\n\n/**\n * Used when a StableRecordIdentifier was not created locally as part\n * of a call to store.createRecord\n *\n * Distinguishing between this Identifier and one for a client created\n * record that was created with an ID is generally speaking not possible\n * at runtime, so anything with an ID typically narrows to this.\n *\n * @internal\n */\n\n/**\n * Used when a StableRecordIdentifier was created locally\n * (by a call to store.createRecord).\n *\n * It is possible in rare circumstances to have a StableRecordIdentifier\n * that is not for a new record but does not have an ID. This would\n * happen if a user intentionally created one for use with a secondary-index\n * prior to the record having been fully loaded.\n *\n * @internal\n */\n\n/**\n * A referentially stable object with a unique string (lid) that can be used\n * as a reference to data in the cache.\n *\n * Every record instance has a unique identifier, and identifiers may refer\n * to data that has never been loaded (for instance, in an async relationship).\n *\n * @class StableRecordIdentifier\n * @public\n */\n\n/**\n * A string representing a unique identity.\n *\n * @property {string} lid\n * @public\n */\n/**\n * the primary resource `type` or `modelName` this identity belongs to.\n *\n * @property {string} type\n * @public\n */\n/**\n * the primary id for the record this identity belongs to. `null`\n * if not yet assigned an id.\n *\n * @property {string | null} id\n * @public\n */\n\nexport { CACHE_OWNER, DEBUG_CLIENT_ORIGINATED, DEBUG_IDENTIFIER_BUCKET, DEBUG_STALE_CACHE_OWNER };","import { deprecate, warn } from '@ember/debug';\nimport { macroCondition, getGlobalConfig, dependencySatisfies, importSync } from '@embroider/macros';\nimport { SkipCache, EnableHydration } from '@warp-drive/core-types/request';\nimport { getOrSetGlobal, setTransient, peekTransient } from '@warp-drive/core-types/-private';\nimport { CACHE_OWNER, DEBUG_STALE_CACHE_OWNER, DEBUG_CLIENT_ORIGINATED, DEBUG_IDENTIFIER_BUCKET } from '@warp-drive/core-types/identifier';\nimport { dasherize } from '@ember-data/request-utils/string';\nimport { defineSignal, createSignal, subscribe, createArrayTags, addToTransaction, addTransactionCB } from '@ember-data/tracking/-private';\nimport { _backburner } from '@ember/runloop';\nimport { compat } from '@ember-data/tracking';\n\n/**\n @module @ember-data/store\n*/\n\nfunction coerceId(id) {\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_NON_STRICT_ID)) {\n let normalized;\n if (id === null || id === undefined || id === '') {\n normalized = null;\n } else {\n normalized = String(id);\n }\n deprecate(`The resource id '<${typeof id}> ${String(id)} ' is not normalized. Update your application code to use '${JSON.stringify(normalized)}' instead.`, normalized === id, {\n id: 'ember-data:deprecate-non-strict-id',\n until: '6.0',\n for: 'ember-data',\n since: {\n available: '5.3',\n enabled: '5.3'\n }\n });\n return normalized;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Resource IDs must be a non-empty string or null. Received '${String(id)}'.`);\n }\n })(id === null || typeof id === 'string' && id.length > 0) : {};\n return id;\n}\nfunction ensureStringId(id) {\n let normalized = null;\n if (typeof id === 'string') {\n normalized = id.length > 0 ? id : null;\n } else if (typeof id === 'number' && !isNaN(id)) {\n normalized = String(id);\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected id to be a string or number, received ${String(id)}`);\n }\n })(normalized !== null) : {};\n return normalized;\n}\nfunction normalizeModelName(type) {\n if (macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_NON_STRICT_TYPES)) {\n const result = dasherize(type);\n deprecate(`The resource type '${type}' is not normalized. Update your application code to use '${result}' instead of '${type}'.`, result === type, {\n id: 'ember-data:deprecate-non-strict-types',\n until: '6.0',\n for: 'ember-data',\n since: {\n available: '5.3',\n enabled: '5.3'\n }\n });\n return result;\n }\n return type;\n}\n\n/**\n @module @ember-data/store\n*/\n\nfunction installPolyfill() {\n const isFastBoot = typeof FastBoot !== 'undefined';\n const CRYPTO = isFastBoot ? FastBoot.require('crypto') : window.crypto;\n if (!CRYPTO.randomUUID) {\n // we might be able to optimize this by requesting more bytes than we need at a time\n const rng = function () {\n // WHATWG crypto RNG - http://wiki.whatwg.org/wiki/Crypto\n const rnds8 = new Uint8Array(16);\n if (!CRYPTO.getRandomValues && !isFastBoot) {\n throw new Error(`Unable to generate bytes for UUID`);\n }\n return CRYPTO.getRandomValues ? CRYPTO.getRandomValues(rnds8) : CRYPTO.randomFillSync(rnds8);\n };\n\n /*\n * Convert array of 16 byte values to UUID string format of the form:\n * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX\n */\n const byteToHex = [];\n for (let i = 0; i < 256; ++i) {\n byteToHex[i] = (i + 0x100).toString(16).substr(1);\n }\n const bytesToUuid = function (buf) {\n const bth = byteToHex;\n // join used to fix memory issue caused by concatenation: https://bugs.chromium.org/p/v8/issues/detail?id=3175#c4\n return [bth[buf[0]], bth[buf[1]], bth[buf[2]], bth[buf[3]], '-', bth[buf[4]], bth[buf[5]], '-', bth[buf[6]], bth[buf[7]], '-', bth[buf[8]], bth[buf[9]], '-', bth[buf[10]], bth[buf[11]], bth[buf[12]], bth[buf[13]], bth[buf[14]], bth[buf[15]]].join('');\n };\n CRYPTO.randomUUID = function uuidv4() {\n const rnds = rng();\n\n // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n rnds[6] = rnds[6] & 0x0f | 0x40;\n rnds[8] = rnds[8] & 0x3f | 0x80;\n return bytesToUuid(rnds);\n };\n }\n}\nfunction isResource(resource) {\n return Boolean(resource && typeof resource === 'object');\n}\nfunction hasProp(resource, prop) {\n return Boolean(isResource(resource) && prop in resource && typeof resource[prop] === 'string' && resource[prop].length);\n}\nfunction hasLid(resource) {\n return hasProp(resource, 'lid');\n}\nfunction hasId(resource) {\n return hasProp(resource, 'id') || Boolean(isResource(resource) && 'id' in resource && typeof resource.id === 'number');\n}\nfunction hasType(resource) {\n return hasProp(resource, 'type');\n}\n\n/**\n @module @ember-data/store\n*/\nconst IDENTIFIERS = getOrSetGlobal('IDENTIFIERS', new Set());\nconst DOCUMENTS = getOrSetGlobal('DOCUMENTS', new Set());\nfunction isStableIdentifier(identifier) {\n return identifier[CACHE_OWNER] !== undefined || IDENTIFIERS.has(identifier);\n}\nfunction isDocumentIdentifier(identifier) {\n return DOCUMENTS.has(identifier);\n}\nconst isFastBoot = typeof FastBoot !== 'undefined';\nconst _crypto = isFastBoot ? FastBoot.require('crypto') : window.crypto;\nif (macroCondition(getGlobalConfig().WarpDrive.polyfillUUID)) {\n installPolyfill();\n}\nfunction uuidv4() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('crypto.randomUUID needs to be avaliable. Some browsers incorrectly disallow it in insecure contexts. You maybe want to enable the polyfill: https://github.com/emberjs/data#randomuuid-polyfill');\n }\n })(typeof _crypto.randomUUID === 'function') : {};\n return _crypto.randomUUID();\n}\nfunction freeze(obj) {\n if (typeof Object.freeze === 'function') {\n return Object.freeze(obj);\n }\n return obj;\n}\n\n// type IdentifierTypeLookup = { all: Set; id: Map };\n// type IdentifiersByType = Map;\n\nfunction setIdentifierGenerationMethod(method) {\n setTransient('configuredGenerationMethod', method);\n}\nfunction setIdentifierUpdateMethod(method) {\n setTransient('configuredUpdateMethod', method);\n}\nfunction setIdentifierForgetMethod(method) {\n setTransient('configuredForgetMethod', method);\n}\nfunction setIdentifierResetMethod(method) {\n setTransient('configuredResetMethod', method);\n}\nfunction setKeyInfoForResource(method) {\n setTransient('configuredKeyInfoMethod', method);\n}\n\n// Map>\n\n// TODO can we just delete this?\nconst NEW_IDENTIFIERS = new Map();\n// TODO @runspired maybe needs peekTransient ?\nlet IDENTIFIER_CACHE_ID = 0;\nfunction updateTypeIdMapping(typeMap, identifier, id) {\n let idMap = typeMap.get(identifier.type);\n if (!idMap) {\n idMap = new Map();\n typeMap.set(identifier.type, idMap);\n }\n idMap.set(id, identifier.lid);\n}\nfunction defaultUpdateMethod(identifier, data, bucket) {\n if (bucket === 'record') {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected identifier to be a StableRecordIdentifier`);\n }\n })(isStableIdentifier(identifier)) : {};\n if (!identifier.id && hasId(data)) {\n updateTypeIdMapping(NEW_IDENTIFIERS, identifier, data.id);\n }\n }\n}\nfunction defaultKeyInfoMethod(resource, known) {\n // TODO RFC something to make this configurable\n const id = hasId(resource) ? coerceId(resource.id) : null;\n const type = hasType(resource) ? normalizeModelName(resource.type) : known ? known.type : null;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected keyInfoForResource to provide a type for the resource`);\n }\n })(type) : {};\n return {\n type,\n id\n };\n}\nfunction defaultGenerationMethod(data, bucket) {\n if (bucket === 'record') {\n if (hasLid(data)) {\n return data.lid;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot generate an identifier for a resource without a type`);\n }\n })(hasType(data)) : {};\n if (hasId(data)) {\n const type = normalizeModelName(data.type);\n const lid = NEW_IDENTIFIERS.get(type)?.get(data.id);\n return lid || `@lid:${type}-${data.id}`;\n }\n return uuidv4();\n } else if (bucket === 'document') {\n if (!data.url) {\n return null;\n }\n if (!data.method || data.method.toUpperCase() === 'GET') {\n return data.url;\n }\n return null;\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`Unknown bucket ${bucket}`);\n }\n })() : {};\n}\nfunction defaultEmptyCallback(...args) {}\nfunction defaultMergeMethod(a, _b, _c) {\n return a;\n}\nlet DEBUG_MAP;\nif (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n DEBUG_MAP = getOrSetGlobal('DEBUG_MAP', new WeakMap());\n}\n\n/**\n * Each instance of {Store} receives a unique instance of a IdentifierCache.\n *\n * This cache is responsible for assigning or retrieving the unique identify\n * for arbitrary resource data encountered by the store. Data representing\n * a unique resource or record should always be represented by the same\n * identifier.\n *\n * It can be configured by consuming applications.\n *\n * @class IdentifierCache\n @public\n */\nclass IdentifierCache {\n constructor() {\n // we cache the user configuredGenerationMethod at init because it must\n // be configured prior and is not allowed to be changed\n this._generate = peekTransient('configuredGenerationMethod') || defaultGenerationMethod;\n this._update = peekTransient('configuredUpdateMethod') || defaultUpdateMethod;\n this._forget = peekTransient('configuredForgetMethod') || defaultEmptyCallback;\n this._reset = peekTransient('configuredResetMethod') || defaultEmptyCallback;\n this._merge = defaultMergeMethod;\n this._keyInfoForResource = peekTransient('configuredKeyInfoMethod') || defaultKeyInfoMethod;\n this._id = IDENTIFIER_CACHE_ID++;\n this._cache = {\n resources: new Map(),\n resourcesByType: Object.create(null),\n documents: new Map(),\n polymorphicLidBackMap: new Map()\n };\n }\n\n /**\n * Internal hook to allow management of merge conflicts with identifiers.\n *\n * we allow late binding of this private internal merge so that\n * the cache can insert itself here to handle elimination of duplicates\n *\n * @method __configureMerge\n * @private\n */\n __configureMerge(method) {\n this._merge = method || defaultMergeMethod;\n }\n upgradeIdentifier(resource) {\n return this._getRecordIdentifier(resource, 2);\n }\n\n /**\n * @method _getRecordIdentifier\n * @private\n */\n\n _getRecordIdentifier(resource, shouldGenerate) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.groupCollapsed(`Identifiers: ${shouldGenerate ? 'Generating' : 'Peeking'} Identifier`, resource);\n }\n // short circuit if we're already the stable version\n if (isStableIdentifier(resource)) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n // TODO should we instead just treat this case as a new generation skipping the short circuit?\n if (!this._cache.resources.has(resource.lid) || this._cache.resources.get(resource.lid) !== resource) {\n throw new Error(`The supplied identifier ${JSON.stringify(resource)} does not belong to this store instance`);\n }\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.log(`Identifiers: cache HIT - Stable ${resource.lid}`);\n // eslint-disable-next-line no-console\n console.groupEnd();\n }\n return resource;\n }\n\n // the resource is unknown, ask the application to identify this data for us\n const lid = this._generate(resource, 'record');\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.log(`Identifiers: ${lid ? 'no ' : ''}lid ${lid ? lid + ' ' : ''}determined for resource`, resource);\n }\n let identifier = /*#__NOINLINE__*/getIdentifierFromLid(this._cache, lid, resource);\n if (identifier !== null) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.groupEnd();\n }\n return identifier;\n }\n if (shouldGenerate === 0) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.groupEnd();\n }\n return;\n }\n\n // if we still don't have an identifier, time to generate one\n if (shouldGenerate === 2) {\n resource.lid = lid;\n resource[CACHE_OWNER] = this._id;\n identifier = /*#__NOINLINE__*/makeStableRecordIdentifier(resource, 'record', false);\n } else {\n // we lie a bit here as a memory optimization\n const keyInfo = this._keyInfoForResource(resource, null);\n keyInfo.lid = lid;\n keyInfo[CACHE_OWNER] = this._id;\n identifier = /*#__NOINLINE__*/makeStableRecordIdentifier(keyInfo, 'record', false);\n }\n addResourceToCache(this._cache, identifier);\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.groupEnd();\n }\n return identifier;\n }\n\n /**\n * allows us to peek without generating when needed\n * useful for the \"create\" case when we need to see if\n * we are accidentally overwritting something\n *\n * @method peekRecordIdentifier\n * @param resource\n * @return {StableRecordIdentifier | undefined}\n * @private\n */\n peekRecordIdentifier(resource) {\n return this._getRecordIdentifier(resource, 0);\n }\n\n /**\n Returns the DocumentIdentifier for the given Request, creates one if it does not yet exist.\n Returns `null` if the request does not have a `cacheKey` or `url`.\n @method getOrCreateDocumentIdentifier\n @param request\n @return {StableDocumentIdentifier | null}\n @public\n */\n getOrCreateDocumentIdentifier(request) {\n let cacheKey = request.cacheOptions?.key;\n if (!cacheKey) {\n cacheKey = this._generate(request, 'document');\n }\n if (!cacheKey) {\n return null;\n }\n let identifier = this._cache.documents.get(cacheKey);\n if (identifier === undefined) {\n identifier = {\n lid: cacheKey\n };\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n Object.freeze(identifier);\n }\n DOCUMENTS.add(identifier);\n this._cache.documents.set(cacheKey, identifier);\n }\n return identifier;\n }\n\n /**\n Returns the Identifier for the given Resource, creates one if it does not yet exist.\n Specifically this means that we:\n - validate the `id` `type` and `lid` combo against known identifiers\n - return an object with an `lid` that is stable (repeated calls with the same\n `id` + `type` or `lid` will return the same `lid` value)\n - this referential stability of the object itself is guaranteed\n @method getOrCreateRecordIdentifier\n @param resource\n @return {StableRecordIdentifier}\n @public\n */\n getOrCreateRecordIdentifier(resource) {\n return this._getRecordIdentifier(resource, 1);\n }\n\n /**\n Returns a new Identifier for the supplied data. Call this method to generate\n an identifier when a new resource is being created local to the client and\n potentially does not have an `id`.\n Delegates generation to the user supplied `GenerateMethod` if one has been provided\n with the signature `generateMethod({ type }, 'record')`.\n @method createIdentifierForNewRecord\n @param data\n @return {StableRecordIdentifier}\n @public\n */\n createIdentifierForNewRecord(data) {\n const newLid = this._generate(data, 'record');\n const identifier = /*#__NOINLINE__*/makeStableRecordIdentifier({\n id: data.id || null,\n type: data.type,\n lid: newLid,\n [CACHE_OWNER]: this._id\n }, 'record', true);\n\n // populate our unique table\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (this._cache.resources.has(identifier.lid)) {\n throw new Error(`The lid generated for the new record is not unique as it matches an existing identifier`);\n }\n }\n\n /*#__NOINLINE__*/\n addResourceToCache(this._cache, identifier);\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.log(`Identifiers: created identifier ${String(identifier)} for newly generated resource`, data);\n }\n return identifier;\n }\n\n /**\n Provides the opportunity to update secondary lookup tables for existing identifiers\n Called after an identifier created with `createIdentifierForNewRecord` has been\n committed.\n Assigned `id` to an `Identifier` if `id` has not previously existed; however,\n attempting to change the `id` or calling update without providing an `id` when\n one is missing will throw an error.\n - sets `id` (if `id` was previously `null`)\n - `lid` and `type` MUST NOT be altered post creation\n If a merge occurs, it is possible the returned identifier does not match the originally\n provided identifier. In this case the abandoned identifier will go through the usual\n `forgetRecordIdentifier` codepaths.\n @method updateRecordIdentifier\n @param identifierObject\n @param data\n @return {StableRecordIdentifier}\n @public\n */\n updateRecordIdentifier(identifierObject, data) {\n let identifier = this.getOrCreateRecordIdentifier(identifierObject);\n const keyInfo = this._keyInfoForResource(data, identifier);\n let existingIdentifier = /*#__NOINLINE__*/detectMerge(this._cache, keyInfo, identifier, data);\n const hadLid = hasLid(data);\n if (!existingIdentifier) {\n // If the incoming type does not match the identifier type, we need to create an identifier for the incoming\n // data so we can merge the incoming data with the existing identifier, see #7325 and #7363\n if (identifier.type !== keyInfo.type) {\n if (hadLid) {\n // Strip the lid to ensure we force a new identifier creation\n delete data.lid;\n }\n existingIdentifier = this.getOrCreateRecordIdentifier(data);\n }\n }\n if (existingIdentifier) {\n const generatedIdentifier = identifier;\n identifier = this._mergeRecordIdentifiers(keyInfo, generatedIdentifier, existingIdentifier, data);\n\n // make sure that the `lid` on the data we are processing matches the lid we kept\n if (hadLid) {\n data.lid = identifier.lid;\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.log(`Identifiers: merged identifiers ${generatedIdentifier.lid} and ${existingIdentifier.lid} for resource into ${identifier.lid}`, data);\n }\n }\n const id = identifier.id;\n /*#__NOINLINE__*/\n performRecordIdentifierUpdate(identifier, keyInfo, data, this._update);\n const newId = identifier.id;\n\n // add to our own secondary lookup table\n if (id !== newId && newId !== null) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.log(`Identifiers: updated id for identifier ${identifier.lid} from '${String(id)}' to '${String(newId)}' for resource`, data);\n }\n const typeSet = this._cache.resourcesByType[identifier.type];\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected to find a typeSet for ${identifier.type}`);\n }\n })(typeSet) : {};\n typeSet.id.set(newId, identifier);\n if (id !== null) {\n typeSet.id.delete(id);\n }\n } else if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.log(`Identifiers: updated identifier ${identifier.lid} resource`, data);\n }\n return identifier;\n }\n\n /**\n * @method _mergeRecordIdentifiers\n * @private\n */\n _mergeRecordIdentifiers(keyInfo, identifier, existingIdentifier, data) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected keyInfo to contain an id`);\n }\n })(hasId(keyInfo)) : {};\n // delegate determining which identifier to keep to the configured MergeMethod\n const kept = this._merge(identifier, existingIdentifier, data);\n const abandoned = kept === identifier ? existingIdentifier : identifier;\n\n // get any backreferences before forgetting this identifier, as it will be removed from the cache\n // and we will no longer be able to find them\n const abandonedBackReferences = this._cache.polymorphicLidBackMap.get(abandoned.lid);\n // delete the backreferences for the abandoned identifier so that forgetRecordIdentifier\n // does not try to remove them.\n if (abandonedBackReferences) this._cache.polymorphicLidBackMap.delete(abandoned.lid);\n\n // cleanup the identifier we no longer need\n this.forgetRecordIdentifier(abandoned);\n\n // ensure a secondary cache entry for the original lid for the abandoned identifier\n this._cache.resources.set(abandoned.lid, kept);\n\n // backReferences let us know which other identifiers are pointing at this identifier\n // so we can delete them later if we forget this identifier\n const keptBackReferences = this._cache.polymorphicLidBackMap.get(kept.lid) ?? [];\n keptBackReferences.push(abandoned.lid);\n\n // update the backreferences from the abandoned identifier to be for the kept identifier\n if (abandonedBackReferences) {\n abandonedBackReferences.forEach(lid => {\n keptBackReferences.push(lid);\n this._cache.resources.set(lid, kept);\n });\n }\n this._cache.polymorphicLidBackMap.set(kept.lid, keptBackReferences);\n return kept;\n }\n\n /**\n Provides the opportunity to eliminate an identifier from secondary lookup tables\n as well as eliminates it from ember-data's own lookup tables and book keeping.\n Useful when a record has been deleted and the deletion has been persisted and\n we do not care about the record anymore. Especially useful when an `id` of a\n deleted record might be reused later for a new record.\n @method forgetRecordIdentifier\n @param identifierObject\n @public\n */\n forgetRecordIdentifier(identifierObject) {\n const identifier = this.getOrCreateRecordIdentifier(identifierObject);\n const typeSet = this._cache.resourcesByType[identifier.type];\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected to find a typeSet for ${identifier.type}`);\n }\n })(typeSet) : {};\n if (identifier.id !== null) {\n typeSet.id.delete(identifier.id);\n }\n this._cache.resources.delete(identifier.lid);\n typeSet.lid.delete(identifier.lid);\n const backReferences = this._cache.polymorphicLidBackMap.get(identifier.lid);\n if (backReferences) {\n backReferences.forEach(lid => {\n this._cache.resources.delete(lid);\n });\n this._cache.polymorphicLidBackMap.delete(identifier.lid);\n }\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n identifier[DEBUG_STALE_CACHE_OWNER] = identifier[CACHE_OWNER];\n }\n identifier[CACHE_OWNER] = undefined;\n IDENTIFIERS.delete(identifier);\n this._forget(identifier, 'record');\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.log(`Identifiers: released identifier ${identifierObject.lid}`);\n }\n }\n destroy() {\n NEW_IDENTIFIERS.clear();\n this._cache.documents.forEach(identifier => {\n DOCUMENTS.delete(identifier);\n });\n this._reset();\n }\n}\nfunction makeStableRecordIdentifier(recordIdentifier, bucket, clientOriginated) {\n IDENTIFIERS.add(recordIdentifier);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n // we enforce immutability in dev\n // but preserve our ability to do controlled updates to the reference\n let wrapper = {\n get lid() {\n return recordIdentifier.lid;\n },\n get id() {\n return recordIdentifier.id;\n },\n get type() {\n return recordIdentifier.type;\n },\n get [CACHE_OWNER]() {\n return recordIdentifier[CACHE_OWNER];\n },\n set [CACHE_OWNER](value) {\n recordIdentifier[CACHE_OWNER] = value;\n },\n get [DEBUG_STALE_CACHE_OWNER]() {\n return recordIdentifier[DEBUG_STALE_CACHE_OWNER];\n },\n set [DEBUG_STALE_CACHE_OWNER](value) {\n recordIdentifier[DEBUG_STALE_CACHE_OWNER] = value;\n }\n };\n Object.defineProperty(wrapper, 'toString', {\n enumerable: false,\n value: () => {\n const {\n type,\n id,\n lid\n } = recordIdentifier;\n return `${clientOriginated ? '[CLIENT_ORIGINATED] ' : ''}${String(type)}:${String(id)} (${lid})`;\n }\n });\n Object.defineProperty(wrapper, 'toJSON', {\n enumerable: false,\n value: () => {\n const {\n type,\n id,\n lid\n } = recordIdentifier;\n return {\n type,\n id,\n lid\n };\n }\n });\n wrapper[DEBUG_CLIENT_ORIGINATED] = clientOriginated;\n wrapper[DEBUG_IDENTIFIER_BUCKET] = bucket;\n IDENTIFIERS.add(wrapper);\n DEBUG_MAP.set(wrapper, recordIdentifier);\n wrapper = freeze(wrapper);\n return wrapper;\n }\n return recordIdentifier;\n}\nfunction performRecordIdentifierUpdate(identifier, keyInfo, data, updateFn) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n const {\n id,\n type\n } = keyInfo;\n\n // get the mutable instance behind our proxy wrapper\n const wrapper = identifier;\n identifier = DEBUG_MAP.get(wrapper);\n if (hasLid(data)) {\n const lid = data.lid;\n if (lid !== identifier.lid) {\n throw new Error(`The 'lid' for a RecordIdentifier cannot be updated once it has been created. Attempted to set lid for '${wrapper.lid}' to '${lid}'.`);\n }\n }\n if (id && identifier.id !== null && identifier.id !== id) {\n // here we warn and ignore, as this may be a mistake, but we allow the user\n // to have multiple cache-keys pointing at a single lid so we cannot error\n warn(`The 'id' for a RecordIdentifier should not be updated once it has been set. Attempted to set id for '${wrapper.lid}' to '${id}'.`, false, {\n id: 'ember-data:multiple-ids-for-identifier'\n });\n }\n\n // TODO consider just ignoring here to allow flexible polymorphic support\n if (type && type !== identifier.type) {\n throw new Error(`The 'type' for a RecordIdentifier cannot be updated once it has been set. Attempted to set type for '${wrapper.lid}' to '${type}'.`);\n }\n updateFn(wrapper, data, 'record');\n } else {\n updateFn(identifier, data, 'record');\n }\n\n // upgrade the ID, this is a \"one time only\" ability\n // for the multiple-cache-key scenario we \"could\"\n // use a heuristic to guess the best id for display\n // (usually when `data.id` is available and `data.attributes` is not)\n if (data.id !== undefined) {\n identifier.id = coerceId(data.id);\n }\n}\nfunction detectMerge(cache, keyInfo, identifier, data) {\n const newId = keyInfo.id;\n const {\n id,\n type,\n lid\n } = identifier;\n const typeSet = cache.resourcesByType[identifier.type];\n\n // if the IDs are present but do not match\n // then check if we have an existing identifier\n // for the newer ID.\n if (id !== null && id !== newId && newId !== null) {\n const existingIdentifier = typeSet && typeSet.id.get(newId);\n return existingIdentifier !== undefined ? existingIdentifier : false;\n } else {\n const newType = keyInfo.type;\n\n // If the ids and type are the same but lid is not the same, we should trigger a merge of the identifiers\n // we trigger a merge of the identifiers\n // though probably we should just throw an error here\n if (id !== null && id === newId && newType === type && hasLid(data) && data.lid !== lid) {\n return getIdentifierFromLid(cache, data.lid, data) || false;\n\n // If the lids are the same, and ids are the same, but types are different we should trigger a merge of the identifiers\n } else if (id !== null && id === newId && newType && newType !== type && hasLid(data) && data.lid === lid) {\n const newTypeSet = cache.resourcesByType[newType];\n const existingIdentifier = newTypeSet && newTypeSet.id.get(newId);\n return existingIdentifier !== undefined ? existingIdentifier : false;\n }\n }\n return false;\n}\nfunction getIdentifierFromLid(cache, lid, resource) {\n const identifier = cache.resources.get(lid);\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_IDENTIFIERS)) {\n // eslint-disable-next-line no-console\n console.log(`Identifiers: cache ${identifier ? 'HIT' : 'MISS'} - Non-Stable ${lid}`, resource);\n }\n return identifier || null;\n}\nfunction addResourceToCache(cache, identifier) {\n cache.resources.set(identifier.lid, identifier);\n let typeSet = cache.resourcesByType[identifier.type];\n if (!typeSet) {\n typeSet = {\n lid: new Map(),\n id: new Map()\n };\n cache.resourcesByType[identifier.type] = typeSet;\n }\n typeSet.lid.set(identifier.lid, identifier);\n if (identifier.id) {\n typeSet.id.set(identifier.id, identifier);\n }\n}\n\n/**\n @module @ember-data/store\n*/\n\n/**\n A `RecordReference` is a low-level API that allows users and\n addon authors to perform meta-operations on a record.\n\n @class RecordReference\n @public\n*/\nclass RecordReference {\n // unsubscribe token given to us by the notification manager\n ___token;\n ___identifier;\n constructor(store, identifier) {\n this.store = store;\n this.___identifier = identifier;\n this.___token = store.notifications.subscribe(identifier, (_, bucket, notifiedKey) => {\n if (bucket === 'identity' || bucket === 'attributes' && notifiedKey === 'id') {\n this._ref++;\n }\n });\n }\n destroy() {\n this.store.notifications.unsubscribe(this.___token);\n }\n get type() {\n return this.identifier().type;\n }\n\n /**\n The `id` of the record that this reference refers to.\n Together, the `type` and `id` properties form a composite key for\n the identity map.\n Example\n ```javascript\n let userRef = store.getReference('user', 1);\n userRef.id(); // '1'\n ```\n @method id\n @public\n @return {String} The id of the record.\n */\n id() {\n this._ref; // consume the tracked prop\n return this.___identifier.id;\n }\n\n /**\n The `identifier` of the record that this reference refers to.\n Together, the `type` and `id` properties form a composite key for\n the identity map.\n Example\n ```javascript\n let userRef = store.getReference('user', 1);\n userRef.identifier(); // '1'\n ```\n @method identifier\n @public\n @return {String} The identifier of the record.\n */\n identifier() {\n return this.___identifier;\n }\n\n /**\n How the reference will be looked up when it is loaded. Currently\n this always returns `identity` to signify that a record will be\n loaded by its `type` and `id`.\n Example\n ```javascript\n const userRef = store.getReference('user', 1);\n userRef.remoteType(); // 'identity'\n ```\n @method remoteType\n @public\n @return {String} 'identity'\n */\n remoteType() {\n return 'identity';\n }\n\n /**\n This API allows you to provide a reference with new data. The\n simplest usage of this API is similar to `store.push`: you provide a\n normalized hash of data and the object represented by the reference\n will update.\n If you pass a promise to `push`, Ember Data will not ask the adapter\n for the data if another attempt to fetch it is made in the\n interim. When the promise resolves, the underlying object is updated\n with the new data, and the promise returned by *this function* is resolved\n with that object.\n For example, `recordReference.push(promise)` will be resolved with a\n record.\n Example\n ```javascript\n let userRef = store.getReference('user', 1);\n // provide data for reference\n userRef.push({\n data: {\n id: \"1\",\n type: \"user\",\n attributes: {\n username: \"@user\"\n }\n }\n }).then(function(user) {\n userRef.value() === user;\n });\n ```\n @method push\n @public\n @param objectOrPromise a JSON:API ResourceDocument or a promise resolving to one\n @return a promise for the value (record or relationship)\n */\n push(objectOrPromise) {\n // TODO @deprecate pushing unresolved payloads\n return Promise.resolve(objectOrPromise).then(data => {\n return this.store.push(data);\n });\n }\n\n /**\n If the entity referred to by the reference is already loaded, it is\n present as `reference.value`. Otherwise the value returned by this function\n is `null`.\n Example\n ```javascript\n let userRef = store.getReference('user', 1);\n userRef.value(); // user\n ```\n @method value\n @public\n @return {Model} the record for this RecordReference\n */\n value() {\n return this.store.peekRecord(this.___identifier);\n }\n\n /**\n Triggers a fetch for the backing entity based on its `remoteType`\n (see `remoteType` definitions per reference type).\n Example\n ```javascript\n let userRef = store.getReference('user', 1);\n // load user (via store.find)\n userRef.load().then(...)\n ```\n @method load\n @public\n @return {Promise} the record for this RecordReference\n */\n load() {\n const id = this.id();\n if (id !== null) {\n return this.store.findRecord(this.type, id);\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`Unable to fetch record of type ${this.type} without an id`);\n }\n })() : {};\n }\n\n /**\n Reloads the record if it is already loaded. If the record is not\n loaded it will load the record via `store.findRecord`\n Example\n ```javascript\n let userRef = store.getReference('user', 1);\n // or trigger a reload\n userRef.reload().then(...)\n ```\n @method reload\n @public\n @return {Promise} the record for this RecordReference\n */\n reload() {\n const id = this.id();\n if (id !== null) {\n return this.store.findRecord(this.type, id, {\n reload: true\n });\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`Unable to fetch record of type ${this.type} without an id`);\n }\n })() : {};\n }\n}\ndefineSignal(RecordReference.prototype, '_ref');\n\n/**\n @module @ember-data/store\n*/\nclass CacheCapabilitiesManager {\n constructor(_store) {\n this._store = _store;\n this._willNotify = false;\n this._pendingNotifies = new Map();\n }\n get identifierCache() {\n return this._store.identifierCache;\n }\n _scheduleNotification(identifier, key) {\n let pending = this._pendingNotifies.get(identifier);\n if (!pending) {\n pending = new Set();\n this._pendingNotifies.set(identifier, pending);\n }\n pending.add(key);\n if (this._willNotify === true) {\n return;\n }\n this._willNotify = true;\n // it's possible a cache adhoc notifies us,\n // in which case we sync flush\n if (this._store._cbs) {\n this._store._schedule('notify', () => this._flushNotifications());\n } else {\n // TODO @runspired determine if relationship mutations should schedule\n // into join/run vs immediate flush\n this._flushNotifications();\n }\n }\n _flushNotifications() {\n if (this._willNotify === false) {\n return;\n }\n const pending = this._pendingNotifies;\n this._pendingNotifies = new Map();\n this._willNotify = false;\n pending.forEach((set, identifier) => {\n set.forEach(key => {\n this._store.notifications.notify(identifier, 'relationships', key);\n });\n });\n }\n notifyChange(identifier, namespace, key) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a stable identifier`);\n }\n })(isStableIdentifier(identifier) || isDocumentIdentifier(identifier)) : {};\n\n // TODO do we still get value from this?\n if (namespace === 'relationships' && key) {\n this._scheduleNotification(identifier, key);\n return;\n }\n\n // @ts-expect-error\n this._store.notifications.notify(identifier, namespace, key);\n }\n get schema() {\n return this._store.schema;\n }\n setRecordId(identifier, id) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a stable identifier`);\n }\n })(isStableIdentifier(identifier)) : {};\n this._store._instanceCache.setRecordId(identifier, id);\n }\n hasRecord(identifier) {\n return Boolean(this._store._instanceCache.peek(identifier));\n }\n disconnectRecord(identifier) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a stable identifier`);\n }\n })(isStableIdentifier(identifier)) : {};\n this._store._instanceCache.disconnect(identifier);\n this._pendingNotifies.delete(identifier);\n }\n}\nif (macroCondition(getGlobalConfig().WarpDrive.deprecations.ENABLE_LEGACY_SCHEMA_SERVICE)) {\n CacheCapabilitiesManager.prototype.getSchemaDefinitionService = function () {\n // FIXME add deprecation for this\n return this._store.schema;\n };\n}\n\n/*\n * Returns the Cache instance associated with a given\n * Model or Identifier\n */\n\nconst CacheForIdentifierCache = getOrSetGlobal('CacheForIdentifierCache', new Map());\nfunction setCacheFor(identifier, cache) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Illegal set of identifier`);\n }\n })(!CacheForIdentifierCache.has(identifier) || CacheForIdentifierCache.get(identifier) === cache) : {};\n CacheForIdentifierCache.set(identifier, cache);\n}\nfunction removeRecordDataFor(identifier) {\n CacheForIdentifierCache.delete(identifier);\n}\nfunction peekCache(instance) {\n if (CacheForIdentifierCache.has(instance)) {\n return CacheForIdentifierCache.get(instance);\n }\n return null;\n}\nfunction isDestroyable(record) {\n return Boolean(record && typeof record === 'object' && typeof record.destroy === 'function');\n}\n\n/**\n @module @ember-data/store\n*/\n\nconst RecordCache = getOrSetGlobal('RecordCache', new Map());\nfunction peekRecordIdentifier(record) {\n return RecordCache.get(record);\n}\n\n/**\n Retrieves the unique referentially-stable [RecordIdentifier](/ember-data/release/classes/StableRecordIdentifier)\n assigned to the given record instance.\n ```js\n import { recordIdentifierFor } from \"@ember-data/store\";\n // ... gain access to a record, for instance with peekRecord or findRecord\n const record = store.peekRecord(\"user\", \"1\");\n // get the identifier for the record (see docs for StableRecordIdentifier)\n const identifier = recordIdentifierFor(record);\n // access the identifier's properties.\n const { id, type, lid } = identifier;\n ```\n @method recordIdentifierFor\n @public\n @static\n @for @ember-data/store\n @param {Object} record a record instance previously obstained from the store.\n @return {StableRecordIdentifier}\n */\n\nfunction recordIdentifierFor(record) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`${String(record)} is not a record instantiated by @ember-data/store`);\n }\n })(RecordCache.has(record)) : {};\n return RecordCache.get(record);\n}\nfunction setRecordIdentifier(record, identifier) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n if (RecordCache.has(record) && RecordCache.get(record) !== identifier) {\n throw new Error(`${String(record)} was already assigned an identifier`);\n }\n }\n\n /*\n It would be nice to do a reverse check here that an identifier has not\n previously been assigned a record; however, unload + rematerialization\n prevents us from having a great way of doing so when CustomRecordClasses\n don't necessarily give us access to a `isDestroyed` for dematerialized\n instance.\n */\n\n RecordCache.set(record, identifier);\n}\nconst StoreMap = getOrSetGlobal('StoreMap', new Map());\nfunction storeFor(record) {\n const store = StoreMap.get(record);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`A record in a disconnected state cannot utilize the store. This typically means the record has been destroyed, most commonly by unloading it.`);\n }\n })(store) : {};\n return store;\n}\nclass InstanceCache {\n __instances = {\n record: new Map(),\n reference: new WeakMap()\n };\n constructor(store) {\n this.store = store;\n this._storeWrapper = new CacheCapabilitiesManager(this.store);\n store.identifierCache.__configureMerge((identifier, matchedIdentifier, resourceData) => {\n let keptIdentifier = identifier;\n if (identifier.id !== matchedIdentifier.id) {\n // @ts-expect-error TODO this needs to be fixed\n keptIdentifier = 'id' in resourceData && identifier.id === resourceData.id ? identifier : matchedIdentifier;\n } else if (identifier.type !== matchedIdentifier.type) {\n keptIdentifier =\n // @ts-expect-error TODO this needs to be fixed\n 'type' in resourceData && identifier.type === resourceData.type ? identifier : matchedIdentifier;\n }\n const staleIdentifier = identifier === keptIdentifier ? matchedIdentifier : identifier;\n\n // check for duplicate entities\n const keptHasRecord = this.__instances.record.has(keptIdentifier);\n const staleHasRecord = this.__instances.record.has(staleIdentifier);\n\n // we cannot merge entities when both have records\n // (this may not be strictly true, we could probably swap the cache data the record points at)\n if (keptHasRecord && staleHasRecord) {\n // TODO we probably don't need to throw these errors anymore\n // we can probably just \"swap\" what data source the abandoned\n // record points at so long as\n // it itself is not retained by the store in any way.\n // @ts-expect-error TODO this needs to be fixed\n if ('id' in resourceData) {\n throw new Error(`Failed to update the 'id' for the RecordIdentifier '${identifier.type}:${String(identifier.id)} (${identifier.lid})' to '${String(resourceData.id)}', because that id is already in use by '${matchedIdentifier.type}:${String(matchedIdentifier.id)} (${matchedIdentifier.lid})'`);\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`Failed to update the RecordIdentifier '${identifier.type}:${String(identifier.id)} (${identifier.lid})' to merge with the detected duplicate identifier '${matchedIdentifier.type}:${String(matchedIdentifier.id)} (${String(matchedIdentifier.lid)})'`);\n }\n })() : {};\n }\n this.store.cache.patch({\n op: 'mergeIdentifiers',\n record: staleIdentifier,\n value: keptIdentifier\n });\n\n /*\n TODO @runspired consider adding this to make polymorphism even nicer\n if (identifier.type !== matchedIdentifier.type) {\n this.store._graph?.registerPolymorphicType(identifier.type, matchedIdentifier.type);\n }\n */\n\n this.unloadRecord(staleIdentifier);\n return keptIdentifier;\n });\n }\n peek(identifier) {\n return this.__instances.record.get(identifier);\n }\n getRecord(identifier, properties) {\n let record = this.__instances.record.get(identifier);\n if (!record) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot create a new record instance while the store is being destroyed`);\n }\n })(!this.store.isDestroying && !this.store.isDestroyed) : {};\n const cache = this.store.cache;\n setCacheFor(identifier, cache);\n record = this.store.instantiateRecord(identifier, properties || {});\n setRecordIdentifier(record, identifier);\n setCacheFor(record, cache);\n StoreMap.set(record, this.store);\n this.__instances.record.set(identifier, record);\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_INSTANCE_CACHE)) {\n // eslint-disable-next-line no-console\n console.log(`InstanceCache: created Record for ${String(identifier)}`, properties);\n }\n }\n return record;\n }\n getReference(identifier) {\n const cache = this.__instances.reference;\n let reference = cache.get(identifier);\n if (!reference) {\n reference = new RecordReference(this.store, identifier);\n cache.set(identifier, reference);\n }\n return reference;\n }\n recordIsLoaded(identifier, filterDeleted = false) {\n const cache = this.cache;\n if (!cache) {\n return false;\n }\n const isNew = cache.isNew(identifier);\n const isEmpty = cache.isEmpty(identifier);\n\n // if we are new we must consider ourselves loaded\n if (isNew) {\n return !cache.isDeleted(identifier);\n }\n // even if we have a past request, if we are now empty we are not loaded\n // typically this is true after an unloadRecord call\n\n // if we are not empty, not new && we have a fulfilled request then we are loaded\n // we should consider allowing for something to be loaded that is simply \"not empty\".\n // which is how RecordState currently handles this case; however, RecordState is buggy\n // in that it does not account for unloading.\n return filterDeleted && cache.isDeletionCommitted(identifier) ? false : !isEmpty;\n }\n disconnect(identifier) {\n const record = this.__instances.record.get(identifier);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('Cannot destroy record while it is still materialized');\n }\n })(!isDestroyable(record) || record.isDestroyed || record.isDestroying) : {};\n this.store._graph?.remove(identifier);\n this.store.identifierCache.forgetRecordIdentifier(identifier);\n removeRecordDataFor(identifier);\n this.store._requestCache._clearEntries(identifier);\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_INSTANCE_CACHE)) {\n // eslint-disable-next-line no-console\n console.log(`InstanceCache: disconnected ${String(identifier)}`);\n }\n }\n unloadRecord(identifier) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n const requests = this.store.getRequestStateService().getPendingRequestsForRecord(identifier);\n if (requests.some(req => {\n return req.type === 'mutation';\n })) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`You can only unload a record which is not inFlight. '${String(identifier)}'`);\n }\n })() : {};\n }\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_INSTANCE_CACHE)) {\n // eslint-disable-next-line no-console\n console.groupCollapsed(`InstanceCache: unloading record for ${String(identifier)}`);\n }\n\n // TODO is this join still necessary?\n this.store._join(() => {\n const record = this.__instances.record.get(identifier);\n const cache = this.cache;\n if (record) {\n this.store.teardownRecord(record);\n this.__instances.record.delete(identifier);\n StoreMap.delete(record);\n RecordCache.delete(record);\n removeRecordDataFor(record);\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_INSTANCE_CACHE)) {\n // eslint-disable-next-line no-console\n console.log(`InstanceCache: destroyed record for ${String(identifier)}`);\n }\n }\n if (cache) {\n cache.unloadRecord(identifier);\n removeRecordDataFor(identifier);\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_INSTANCE_CACHE)) {\n // eslint-disable-next-line no-console\n console.log(`InstanceCache: destroyed cache for ${String(identifier)}`);\n }\n } else {\n this.disconnect(identifier);\n }\n this.store._requestCache._clearEntries(identifier);\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_INSTANCE_CACHE)) {\n // eslint-disable-next-line no-console\n console.log(`InstanceCache: unloaded RecordData for ${String(identifier)}`);\n // eslint-disable-next-line no-console\n console.groupEnd();\n }\n });\n }\n clear(type) {\n const cache = this.store.identifierCache._cache;\n if (type === undefined) {\n // it would be cool if we could just de-ref cache here\n // but probably would require WeakRef models to do so.\n cache.resources.forEach(identifier => {\n this.unloadRecord(identifier);\n });\n } else {\n const typeCache = cache.resourcesByType;\n const identifiers = typeCache[type]?.lid;\n if (identifiers) {\n identifiers.forEach(identifier => {\n // if (rds.has(identifier)) {\n this.unloadRecord(identifier);\n // }\n // TODO we don't remove the identifier, should we?\n });\n }\n }\n }\n\n // TODO this should move into something coordinating operations\n setRecordId(identifier, id) {\n const {\n type,\n lid\n } = identifier;\n const oldId = identifier.id;\n\n // ID absolutely can't be missing if the oldID is empty (missing Id in response for a new record)\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`'${type}' was saved to the server, but the response does not have an id and your record does not either.`);\n }\n })(!(id === null && oldId === null)) : {};\n\n // ID absolutely can't be different than oldID if oldID is not null\n // TODO this assertion and restriction may not strictly be needed in the identifiers world\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot update the id for '${type}:${lid}' from '${String(oldId)}' to '${id}'.`);\n }\n })(!(oldId !== null && id !== oldId)) : {};\n\n // ID can be null if oldID is not null (altered ID in response for a record)\n // however, this is more than likely a developer error.\n if (oldId !== null && id === null) {\n warn(`Your ${type} record was saved to the server, but the response does not have an id.`, !(oldId !== null && id === null));\n return;\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_INSTANCE_CACHE)) {\n // eslint-disable-next-line no-console\n console.log(`InstanceCache: updating id to '${id}' for record ${String(identifier)}`);\n }\n const existingIdentifier = this.store.identifierCache.peekRecordIdentifier({\n type,\n id\n });\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`'${type}' was saved to the server, but the response returned the new id '${id}', which has already been used with another record.'`);\n }\n })(!existingIdentifier || existingIdentifier === identifier) : {};\n if (identifier.id === null) {\n // TODO potentially this needs to handle merged result\n this.store.identifierCache.updateRecordIdentifier(identifier, {\n type,\n id\n });\n }\n\n // TODO update resource cache if needed ?\n // TODO handle consequences of identifier merge for notifications\n this.store.notifications.notify(identifier, 'identity');\n }\n}\nfunction _resourceIsFullDeleted(identifier, cache) {\n return cache.isDeletionCommitted(identifier) || cache.isNew(identifier) && cache.isDeleted(identifier);\n}\nfunction resourceIsFullyDeleted(instanceCache, identifier) {\n const cache = instanceCache.cache;\n return !cache || _resourceIsFullDeleted(identifier, cache);\n}\n\n/*\n When a find request is triggered on the store, the user can optionally pass in\n attributes and relationships to be preloaded. These are meant to behave as if they\n came back from the server, except the user obtained them out of band and is informing\n the store of their existence. The most common use case is for supporting client side\n nested URLs, such as `/posts/1/comments/2` so the user can do\n `store.findRecord('comment', 2, { preload: { post: 1 } })` without having to fetch the post.\n\n Preloaded data can be attributes and relationships passed in either as IDs or as actual\n models.\n */\n\nfunction preloadData(store, identifier, preload) {\n const jsonPayload = {};\n //TODO(Igor) consider the polymorphic case\n const schemas = store.schema;\n const fields = schemas.fields(identifier);\n Object.keys(preload).forEach(key => {\n const preloadValue = preload[key];\n const field = fields.get(key);\n if (field && (field.kind === 'hasMany' || field.kind === 'belongsTo')) {\n if (!jsonPayload.relationships) {\n jsonPayload.relationships = {};\n }\n jsonPayload.relationships[key] = preloadRelationship(field, preloadValue);\n } else {\n if (!jsonPayload.attributes) {\n jsonPayload.attributes = {};\n }\n jsonPayload.attributes[key] = preloadValue;\n }\n });\n const cache = store.cache;\n const hasRecord = Boolean(store._instanceCache.peek(identifier));\n cache.upsert(identifier, jsonPayload, hasRecord);\n}\nfunction preloadRelationship(schema, preloadValue) {\n const relatedType = schema.type;\n if (schema.kind === 'hasMany') {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('You need to pass in an array to set a hasMany property on a record');\n }\n })(Array.isArray(preloadValue)) : {};\n return {\n data: preloadValue.map(value => _convertPreloadRelationshipToJSON(value, relatedType))\n };\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('You should not pass in an array to set a belongsTo property on a record');\n }\n })(!Array.isArray(preloadValue)) : {};\n return {\n data: preloadValue ? _convertPreloadRelationshipToJSON(preloadValue, relatedType) : null\n };\n}\n\n/*\n findRecord('user', '1', { preload: { friends: ['1'] }});\n findRecord('user', '1', { preload: { friends: [record] }});\n*/\nfunction _convertPreloadRelationshipToJSON(value, type) {\n if (typeof value === 'string' || typeof value === 'number') {\n return {\n type,\n id: ensureStringId(value)\n };\n }\n // TODO if not a record instance assert it's an identifier\n // and allow identifiers to be used\n return recordIdentifierFor(value);\n}\nfunction _clearCaches() {\n RecordCache.clear();\n StoreMap.clear();\n CacheForIdentifierCache.clear();\n}\n\n// if modelFor turns out to be a bottleneck we should replace with a Map\n// and clear it during store teardown.\nconst AvailableShims = getOrSetGlobal('AvailableShims', new WeakMap());\nfunction getShimClass(store, modelName) {\n let shims = AvailableShims.get(store);\n if (!shims) {\n shims = Object.create(null);\n AvailableShims.set(store, shims);\n }\n let shim = shims[modelName];\n if (shim === undefined) {\n shim = shims[modelName] = new ShimModelClass(store, modelName);\n }\n return shim;\n}\n\n// Mimics the static apis of @ember-data/model\nclass ShimModelClass {\n constructor(store, modelName) {\n this.__store = store;\n this.modelName = modelName;\n }\n get fields() {\n const fields = new Map();\n const fieldSchemas = this.__store.schema.fields({\n type: this.modelName\n });\n fieldSchemas.forEach((schema, key) => {\n if (schema.kind === 'attribute' || schema.kind === 'belongsTo' || schema.kind === 'hasMany') {\n fields.set(key, schema.kind);\n }\n });\n return fields;\n }\n get attributes() {\n const attrs = new Map();\n const fields = this.__store.schema.fields({\n type: this.modelName\n });\n fields.forEach((schema, key) => {\n if (schema.kind === 'attribute') {\n attrs.set(key, schema);\n }\n });\n return attrs;\n }\n get relationshipsByName() {\n const rels = new Map();\n const fields = this.__store.schema.fields({\n type: this.modelName\n });\n fields.forEach((schema, key) => {\n if (schema.kind === 'belongsTo' || schema.kind === 'hasMany') {\n rels.set(key, schema);\n }\n });\n return rels;\n }\n eachAttribute(callback, binding) {\n this.__store.schema.fields({\n type: this.modelName\n }).forEach((schema, key) => {\n if (schema.kind === 'attribute') {\n callback.call(binding, key, schema);\n }\n });\n }\n eachRelationship(callback, binding) {\n this.__store.schema.fields({\n type: this.modelName\n }).forEach((schema, key) => {\n if (schema.kind === 'belongsTo' || schema.kind === 'hasMany') {\n callback.call(binding, key, schema);\n }\n });\n }\n eachTransformedAttribute(callback, binding) {\n this.__store.schema.fields({\n type: this.modelName\n }).forEach((schema, key) => {\n if (schema.kind === 'attribute') {\n const type = schema.type;\n if (type) callback.call(binding, key, type);\n }\n });\n }\n}\n\n/**\n * The CacheManager wraps a Cache enforcing that only\n * the public API surface area is exposed.\n *\n * Hence, it is the value of `Store.cache`, wrapping\n * the cache instance returned by `Store.createCache`.\n *\n * It handles translating between cache versions when\n * necessary, for instance when a Store is configured\n * to use both a v1 and a v2 cache depending on some\n * heuristic.\n *\n * Starting with the v2 spec, the cache is designed such\n * that it must be implemented as a singleton.\n *\n * @class CacheManager\n * @public\n */\nclass CacheManager {\n version = '2';\n #cache;\n constructor(cache) {\n this.#cache = cache;\n }\n\n // Cache Management\n // ================\n\n /**\n * Cache the response to a request\n *\n * Unlike `store.push` which has UPSERT\n * semantics, `put` has `replace` semantics similar to\n * the `http` method `PUT`\n *\n * the individually cacheable\n * e resource data it may contain\n * should upsert, but the document data surrounding it should\n * fully replace any existing information\n *\n * Note that in order to support inserting arbitrary data\n * to the cache that did not originate from a request `put`\n * should expect to sometimes encounter a document with only\n * a `content` member and therefor must not assume the existence\n * of `request` and `response` on the document.\n *\n * @method put\n * @param {StructuredDocument} doc\n * @return {ResourceDocument}\n * @public\n */\n put(doc) {\n return this.#cache.put(doc);\n }\n\n /**\n * Perform an operation on the cache to update the remote state.\n *\n * Note: currently the only valid operation is a MergeOperation\n * which occurs when a collision of identifiers is detected.\n *\n * @method patch\n * @public\n * @param op the operation to perform\n * @return {void}\n */\n patch(op) {\n this.#cache.patch(op);\n }\n\n /**\n * Update resource data with a local mutation. Currently supports operations\n * on relationships only.\n *\n * @method mutate\n * @public\n * @param mutation\n */\n mutate(mutation) {\n this.#cache.mutate(mutation);\n }\n\n /**\n * Peek resource data from the Cache.\n *\n * In development, if the return value\n * is JSON the return value\n * will be deep-cloned and deep-frozen\n * to prevent mutation thereby enforcing cache\n * Immutability.\n *\n * This form of peek is useful for implementations\n * that want to feed raw-data from cache to the UI\n * or which want to interact with a blob of data\n * directly from the presentation cache.\n *\n * An implementation might want to do this because\n * de-referencing records which read from their own\n * blob is generally safer because the record does\n * not require retaining connections to the Store\n * and Cache to present data on a per-field basis.\n *\n * This generally takes the place of `getAttr` as\n * an API and may even take the place of `getRelationship`\n * depending on implementation specifics, though this\n * latter usage is less recommended due to the advantages\n * of the Graph handling necessary entanglements and\n * notifications for relational data.\n *\n * @method peek\n * @public\n * @param {StableRecordIdentifier | StableDocumentIdentifier} identifier\n * @return {ResourceDocument | ResourceBlob | null} the known resource data\n */\n\n peek(identifier) {\n return this.#cache.peek(identifier);\n }\n\n /**\n * Peek the Cache for the existing request data associated with\n * a cacheable request\n *\n * @method peekRequest\n * @param {StableDocumentIdentifier}\n * @return {StableDocumentIdentifier | null}\n * @public\n */\n peekRequest(identifier) {\n return this.#cache.peekRequest(identifier);\n }\n\n /**\n * Push resource data from a remote source into the cache for this identifier\n *\n * @method upsert\n * @public\n * @param identifier\n * @param data\n * @param hasRecord\n * @return {void | string[]} if `hasRecord` is true then calculated key changes should be returned\n */\n upsert(identifier, data, hasRecord) {\n return this.#cache.upsert(identifier, data, hasRecord);\n }\n\n // Cache Forking Support\n // =====================\n\n /**\n * Create a fork of the cache from the current state.\n *\n * Applications should typically not call this method themselves,\n * preferring instead to fork at the Store level, which will\n * utilize this method to fork the cache.\n *\n * @method fork\n * @public\n * @return Promise\n */\n fork() {\n return this.#cache.fork();\n }\n\n /**\n * Merge a fork back into a parent Cache.\n *\n * Applications should typically not call this method themselves,\n * preferring instead to merge at the Store level, which will\n * utilize this method to merge the caches.\n *\n * @method merge\n * @param {Cache} cache\n * @public\n * @return Promise\n */\n merge(cache) {\n return this.#cache.merge(cache);\n }\n\n /**\n * Generate the list of changes applied to all\n * record in the store.\n *\n * Each individual resource or document that has\n * been mutated should be described as an individual\n * `Change` entry in the returned array.\n *\n * A `Change` is described by an object containing up to\n * three properties: (1) the `identifier` of the entity that\n * changed; (2) the `op` code of that change being one of\n * `upsert` or `remove`, and if the op is `upsert` a `patch`\n * containing the data to merge into the cache for the given\n * entity.\n *\n * This `patch` is opaque to the Store but should be understood\n * by the Cache and may expect to be utilized by an Adapter\n * when generating data during a `save` operation.\n *\n * It is generally recommended that the `patch` contain only\n * the updated state, ignoring fields that are unchanged\n *\n * ```ts\n * interface Change {\n * identifier: StableRecordIdentifier | StableDocumentIdentifier;\n * op: 'upsert' | 'remove';\n * patch?: unknown;\n * }\n * ```\n *\n * @method diff\n * @public\n */\n diff() {\n return this.#cache.diff();\n }\n\n // SSR Support\n // ===========\n\n /**\n * Serialize the entire contents of the Cache into a Stream\n * which may be fed back into a new instance of the same Cache\n * via `cache.hydrate`.\n *\n * @method dump\n * @return {Promise}\n * @public\n */\n dump() {\n return this.#cache.dump();\n }\n\n /**\n * hydrate a Cache from a Stream with content previously serialized\n * from another instance of the same Cache, resolving when hydration\n * is complete.\n *\n * This method should expect to be called both in the context of restoring\n * the Cache during application rehydration after SSR **AND** at unknown\n * times during the lifetime of an already booted application when it is\n * desired to bulk-load additional information into the cache. This latter\n * behavior supports optimizing pre/fetching of data for route transitions\n * via data-only SSR modes.\n *\n * @method hydrate\n * @param {ReadableStream} stream\n * @return {Promise}\n * @public\n */\n hydrate(stream) {\n return this.#cache.hydrate(stream);\n }\n\n // Cache\n // =====\n\n // Resource Support\n // ================\n\n /**\n * [LIFECYCLE] Signal to the cache that a new record has been instantiated on the client\n *\n * It returns properties from options that should be set on the record during the create\n * process. This return value behavior is deprecated.\n *\n * @method clientDidCreate\n * @public\n * @param identifier\n * @param options\n */\n clientDidCreate(identifier, options) {\n return this.#cache.clientDidCreate(identifier, options);\n }\n\n /**\n * [LIFECYCLE] Signals to the cache that a resource\n * will be part of a save transaction.\n *\n * @method willCommit\n * @public\n * @param identifier\n */\n willCommit(identifier, context) {\n this.#cache.willCommit(identifier, context);\n }\n\n /**\n * [LIFECYCLE] Signals to the cache that a resource\n * was successfully updated as part of a save transaction.\n *\n * @method didCommit\n * @public\n * @param identifier\n * @param data\n */\n didCommit(identifier, result) {\n return this.#cache.didCommit(identifier, result);\n }\n\n /**\n * [LIFECYCLE] Signals to the cache that a resource\n * was update via a save transaction failed.\n *\n * @method commitWasRejected\n * @public\n * @param identifier\n * @param errors\n */\n commitWasRejected(identifier, errors) {\n this.#cache.commitWasRejected(identifier, errors);\n }\n\n /**\n * [LIFECYCLE] Signals to the cache that all data for a resource\n * should be cleared.\n *\n * @method unloadRecord\n * @public\n * @param identifier\n */\n unloadRecord(identifier) {\n this.#cache.unloadRecord(identifier);\n }\n\n // Granular Resource Data APIs\n // ===========================\n\n /**\n * Retrieve the data for an attribute from the cache\n *\n * @method getAttr\n * @public\n * @param identifier\n * @param propertyName\n * @return {unknown}\n */\n getAttr(identifier, propertyName) {\n return this.#cache.getAttr(identifier, propertyName);\n }\n\n /**\n * Mutate the data for an attribute in the cache\n *\n * @method setAttr\n * @public\n * @param identifier\n * @param propertyName\n * @param value\n */\n setAttr(identifier, propertyName, value) {\n this.#cache.setAttr(identifier, propertyName, value);\n }\n\n /**\n * Query the cache for the changed attributes of a resource.\n *\n * @method changedAttrs\n * @public\n * @param identifier\n * @return\n */\n changedAttrs(identifier) {\n return this.#cache.changedAttrs(identifier);\n }\n\n /**\n * Query the cache for whether any mutated attributes exist\n *\n * @method hasChangedAttrs\n * @public\n * @param identifier\n * @return {boolean}\n */\n hasChangedAttrs(identifier) {\n return this.#cache.hasChangedAttrs(identifier);\n }\n\n /**\n * Tell the cache to discard any uncommitted mutations to attributes\n *\n * @method rollbackAttrs\n * @public\n * @param identifier\n * @return the names of attributes that were restored\n */\n rollbackAttrs(identifier) {\n return this.#cache.rollbackAttrs(identifier);\n }\n\n // Relationships\n // =============\n\n /**\n * Query the cache for the changes to relationships of a resource.\n *\n * Returns a map of relationship names to RelationshipDiff objects.\n *\n * ```ts\n * type RelationshipDiff =\n | {\n kind: 'collection';\n remoteState: StableRecordIdentifier[];\n additions: Set;\n removals: Set;\n localState: StableRecordIdentifier[];\n reordered: boolean;\n }\n | {\n kind: 'resource';\n remoteState: StableRecordIdentifier | null;\n localState: StableRecordIdentifier | null;\n };\n ```\n *\n * @method changedRelationships\n * @public\n * @param {StableRecordIdentifier} identifier\n * @return {Map}\n */\n changedRelationships(identifier) {\n return this.#cache.changedRelationships(identifier);\n }\n\n /**\n * Query the cache for whether any mutated attributes exist\n *\n * @method hasChangedRelationships\n * @public\n * @param {StableRecordIdentifier} identifier\n * @return {boolean}\n */\n hasChangedRelationships(identifier) {\n return this.#cache.hasChangedRelationships(identifier);\n }\n\n /**\n * Tell the cache to discard any uncommitted mutations to relationships.\n *\n * This will also discard the change on any appropriate inverses.\n *\n * This method is a candidate to become a mutation\n *\n * @method rollbackRelationships\n * @public\n * @param {StableRecordIdentifier} identifier\n * @return {string[]} the names of relationships that were restored\n */\n rollbackRelationships(identifier) {\n return this.#cache.rollbackRelationships(identifier);\n }\n\n /**\n * Query the cache for the current state of a relationship property\n *\n * @method getRelationship\n * @public\n * @param identifier\n * @param propertyName\n * @return resource relationship object\n */\n getRelationship(identifier, propertyName) {\n return this.#cache.getRelationship(identifier, propertyName);\n }\n\n // Resource State\n // ===============\n\n /**\n * Update the cache state for the given resource to be marked as locally deleted,\n * or remove such a mark.\n *\n * @method setIsDeleted\n * @public\n * @param identifier\n * @param isDeleted\n */\n setIsDeleted(identifier, isDeleted) {\n this.#cache.setIsDeleted(identifier, isDeleted);\n }\n\n /**\n * Query the cache for any validation errors applicable to the given resource.\n *\n * @method getErrors\n * @public\n * @param identifier\n * @return\n */\n getErrors(identifier) {\n return this.#cache.getErrors(identifier);\n }\n\n /**\n * Query the cache for whether a given resource has any available data\n *\n * @method isEmpty\n * @public\n * @param identifier\n * @return {boolean}\n */\n isEmpty(identifier) {\n return this.#cache.isEmpty(identifier);\n }\n\n /**\n * Query the cache for whether a given resource was created locally and not\n * yet persisted.\n *\n * @method isNew\n * @public\n * @param identifier\n * @return {boolean}\n */\n isNew(identifier) {\n return this.#cache.isNew(identifier);\n }\n\n /**\n * Query the cache for whether a given resource is marked as deleted (but not\n * necessarily persisted yet).\n *\n * @method isDeleted\n * @public\n * @param identifier\n * @return {boolean}\n */\n isDeleted(identifier) {\n return this.#cache.isDeleted(identifier);\n }\n\n /**\n * Query the cache for whether a given resource has been deleted and that deletion\n * has also been persisted.\n *\n * @method isDeletionCommitted\n * @public\n * @param identifier\n * @return {boolean}\n */\n isDeletionCommitted(identifier) {\n return this.#cache.isDeletionCommitted(identifier);\n }\n}\n\n/**\n * @module @ember-data/store\n */\n// eslint-disable-next-line no-restricted-imports\nlet tokenId = 0;\nconst CacheOperations = new Set(['added', 'removed', 'state', 'updated']);\nfunction isCacheOperationValue(value) {\n return CacheOperations.has(value);\n}\nfunction runLoopIsFlushing() {\n //@ts-expect-error\n return !!_backburner.currentInstance && _backburner._autorun !== true;\n}\nfunction _unsubscribe(tokens, token, cache) {\n const identifier = tokens.get(token);\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_NOTIFICATIONS)) {\n if (!identifier) {\n // eslint-disable-next-line no-console\n console.log('Passed unknown unsubscribe token to unsubscribe', identifier);\n }\n }\n if (identifier) {\n tokens.delete(token);\n const map = cache.get(identifier);\n map?.delete(token);\n }\n}\n\n/**\n * The NotificationManager provides the ability to subscribe to\n * changes to Cache state.\n *\n * This Feature is what allows EmberData to create subscriptions that\n * work with any framework or change-notification system.\n *\n * @class NotificationManager\n * @public\n */\nclass NotificationManager {\n constructor(store) {\n this.store = store;\n this.isDestroyed = false;\n this._buffered = new Map();\n this._hasFlush = false;\n this._cache = new Map();\n this._tokens = new Map();\n }\n\n /**\n * Subscribe to changes for a given resource identifier, resource addition/removal, or document addition/removal.\n *\n * ```ts\n * export type CacheOperation = 'added' | 'removed' | 'updated' | 'state';\n *\n * export interface NotificationCallback {\n * (identifier: StableRecordIdentifier, notificationType: 'attributes' | 'relationships', key?: string): void;\n * (identifier: StableRecordIdentifier, notificationType: 'errors' | 'meta' | 'identity' | 'state'): void;\n * (identifier: StableRecordIdentifier, notificationType: NotificationType, key?: string): void;\n * }\n * export interface ResourceOperationCallback {\n * // resource updates\n * (identifier: StableRecordIdentifier, notificationType: CacheOperation): void;\n * }\n * export interface DocumentOperationCallback {\n * // document updates\n * (identifier: StableDocumentIdentifier, notificationType: CacheOperation): void;\n * }\n * ```\n *\n * @method subscribe\n * @public\n * @param {StableDocumentIdentifier | StableRecordIdentifier | 'resource' | 'document'} identifier\n * @param {NotificationCallback | ResourceOperationCallback | DocumentOperationCallback} callback\n * @return {UnsubscribeToken} an opaque token to be used with unsubscribe\n */\n\n subscribe(identifier, callback) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected to receive a stable Identifier to subscribe to`);\n }\n })(identifier === 'resource' || identifier === 'document' || isStableIdentifier(identifier) || isDocumentIdentifier(identifier)) : {};\n let map = this._cache.get(identifier);\n if (!map) {\n map = new Map();\n this._cache.set(identifier, map);\n }\n const unsubToken = macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? {\n _tokenRef: tokenId++\n } : {};\n map.set(unsubToken, callback);\n this._tokens.set(unsubToken, identifier);\n return unsubToken;\n }\n\n /**\n * remove a previous subscription\n *\n * @method unsubscribe\n * @public\n * @param {UnsubscribeToken} token\n */\n unsubscribe(token) {\n if (!this.isDestroyed) {\n _unsubscribe(this._tokens, token, this._cache);\n }\n }\n\n /**\n * Custom Caches and Application Code should not call this method directly.\n *\n * @method notify\n * @param identifier\n * @param value\n * @param key\n * @return {Boolean} whether a notification was delivered to any subscribers\n * @private\n */\n\n notify(identifier, value, key) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Notify does not accept a key argument for the namespace '${value}'. Received key '${key || ''}'.`);\n }\n })(!key || value === 'attributes' || value === 'relationships') : {};\n if (!isStableIdentifier(identifier) && !isDocumentIdentifier(identifier)) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_NOTIFICATIONS)) {\n // eslint-disable-next-line no-console\n console.log(`Notifying: Expected to receive a stable Identifier to notify '${value}' '${key || ''}' with, but ${String(identifier)} is not in the cache`, identifier);\n }\n return false;\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_NOTIFICATIONS)) {\n // eslint-disable-next-line no-console\n console.log(`Buffering Notify: ${String(identifier.lid)}\\t${value}\\t${key || ''}`);\n }\n const hasSubscribers = Boolean(this._cache.get(identifier)?.size);\n if (isCacheOperationValue(value) || hasSubscribers) {\n let buffer = this._buffered.get(identifier);\n if (!buffer) {\n buffer = [];\n this._buffered.set(identifier, buffer);\n }\n buffer.push([value, key]);\n this._scheduleNotify();\n }\n return hasSubscribers;\n }\n _onNextFlush(cb) {\n this._onFlushCB = cb;\n }\n _scheduleNotify() {\n const asyncFlush = this.store._enableAsyncFlush;\n if (this._hasFlush) {\n if (asyncFlush !== false && !runLoopIsFlushing()) {\n return;\n }\n }\n if (asyncFlush && !runLoopIsFlushing()) {\n this._hasFlush = true;\n return;\n }\n this._flush();\n }\n _flush() {\n if (this._buffered.size) {\n this._buffered.forEach((states, identifier) => {\n states.forEach(args => {\n // @ts-expect-error\n this._flushNotification(identifier, args[0], args[1]);\n });\n });\n this._buffered = new Map();\n }\n this._hasFlush = false;\n this._onFlushCB?.();\n this._onFlushCB = undefined;\n }\n _flushNotification(identifier, value, key) {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_NOTIFICATIONS)) {\n // eslint-disable-next-line no-console\n console.log(`Notifying: ${String(identifier)}\\t${value}\\t${key || ''}`);\n }\n\n // TODO for documents this will need to switch based on Identifier kind\n if (isCacheOperationValue(value)) {\n const callbackMap = this._cache.get(isDocumentIdentifier(identifier) ? 'document' : 'resource');\n if (callbackMap) {\n callbackMap.forEach(cb => {\n cb(identifier, value);\n });\n }\n }\n const callbackMap = this._cache.get(identifier);\n if (!callbackMap || !callbackMap.size) {\n return false;\n }\n callbackMap.forEach(cb => {\n // @ts-expect-error overload doesn't narrow within body\n cb(identifier, value, key);\n });\n return true;\n }\n destroy() {\n this.isDestroyed = true;\n this._tokens.clear();\n this._cache.clear();\n }\n}\n\n/* eslint-disable @typescript-eslint/no-explicit-any */\n/*\n We redefine Proxy because the native Proxy type treats the `target` and\n `receiver` as the same type incorrectly.\n\n We ported this from Typescript's own Proxy types on 3/10/2024.\n*/\n\nconst NativeProxy = Proxy;\nvar __defProp = Object.defineProperty;\nvar __export = (target, all) => {\n for (var name in all) __defProp(target, name, {\n get: all[name],\n enumerable: true\n });\n};\n\n// src/runtime.ts\nvar runtime_exports = {};\n__export(runtime_exports, {\n c: () => decorateClass,\n f: () => decorateFieldV1,\n g: () => decorateFieldV2,\n i: () => initializeDeferredDecorator,\n m: () => decorateMethodV1,\n n: () => decorateMethodV2,\n p: () => decoratePOJO\n});\nvar deferred = /* @__PURE__ */new WeakMap();\nfunction deferDecorator(proto, prop, desc) {\n let map = deferred.get(proto);\n if (!map) {\n map = /* @__PURE__ */new Map();\n deferred.set(proto, map);\n }\n map.set(prop, desc);\n}\nfunction findDeferredDecorator(target, prop) {\n let cursor = target.prototype;\n while (cursor) {\n let desc = deferred.get(cursor)?.get(prop);\n if (desc) {\n return desc;\n }\n cursor = cursor.prototype;\n }\n}\nfunction decorateFieldV1(target, prop, decorators, initializer) {\n return decorateFieldV2(target.prototype, prop, decorators, initializer);\n}\nfunction decorateFieldV2(prototype, prop, decorators, initializer) {\n let desc = {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: null\n };\n if (initializer) {\n desc.initializer = initializer;\n }\n for (let decorator of decorators) {\n desc = decorator(prototype, prop, desc) || desc;\n }\n if (desc.initializer === void 0) {\n Object.defineProperty(prototype, prop, desc);\n } else {\n deferDecorator(prototype, prop, desc);\n }\n}\nfunction decorateMethodV1({\n prototype\n}, prop, decorators) {\n return decorateMethodV2(prototype, prop, decorators);\n}\nfunction decorateMethodV2(prototype, prop, decorators) {\n const origDesc = Object.getOwnPropertyDescriptor(prototype, prop);\n let desc = {\n ...origDesc\n };\n for (let decorator of decorators) {\n desc = decorator(prototype, prop, desc) || desc;\n }\n if (desc.initializer !== void 0) {\n desc.value = desc.initializer ? desc.initializer.call(prototype) : void 0;\n desc.initializer = void 0;\n }\n Object.defineProperty(prototype, prop, desc);\n}\nfunction initializeDeferredDecorator(target, prop) {\n let desc = findDeferredDecorator(target.constructor, prop);\n if (desc) {\n Object.defineProperty(target, prop, {\n enumerable: desc.enumerable,\n configurable: desc.configurable,\n writable: desc.writable,\n value: desc.initializer ? desc.initializer.call(target) : void 0\n });\n }\n}\nfunction decorateClass(target, decorators) {\n return decorators.reduce((accum, decorator) => decorator(accum) || accum, target);\n}\nfunction decoratePOJO(pojo, decorated) {\n for (let [type, prop, decorators] of decorated) {\n if (type === \"field\") {\n decoratePojoField(pojo, prop, decorators);\n } else {\n decorateMethodV2(pojo, prop, decorators);\n }\n }\n return pojo;\n}\nfunction decoratePojoField(pojo, prop, decorators) {\n let desc = {\n configurable: true,\n enumerable: true,\n writable: true,\n initializer: () => Object.getOwnPropertyDescriptor(pojo, prop)?.value\n };\n for (let decorator of decorators) {\n desc = decorator(pojo, prop, desc) || desc;\n }\n if (desc.initializer) {\n desc.value = desc.initializer.call(pojo);\n delete desc.initializer;\n }\n Object.defineProperty(pojo, prop, desc);\n}\n\n/**\n @module @ember-data/store\n*/\nconst ARRAY_GETTER_METHODS = new Set([Symbol.iterator, 'concat', 'entries', 'every', 'fill', 'filter', 'find', 'findIndex', 'flat', 'flatMap', 'forEach', 'includes', 'indexOf', 'join', 'keys', 'lastIndexOf', 'map', 'reduce', 'reduceRight', 'slice', 'some', 'values']);\nconst ARRAY_SETTER_METHODS = new Set(['push', 'pop', 'unshift', 'shift', 'splice', 'sort']);\nconst SYNC_PROPS = new Set(['[]', 'length', 'links', 'meta']);\nfunction isArrayGetter(prop) {\n return ARRAY_GETTER_METHODS.has(prop);\n}\nfunction isArraySetter(prop) {\n return ARRAY_SETTER_METHODS.has(prop);\n}\nfunction isSelfProp(self, prop) {\n return prop in self;\n}\nconst ARRAY_SIGNAL = getOrSetGlobal('#signal', Symbol('#signal'));\nconst SOURCE = getOrSetGlobal('#source', Symbol('#source'));\nconst MUTATE = getOrSetGlobal('#update', Symbol('#update'));\nconst NOTIFY = getOrSetGlobal('#notify', Symbol('#notify'));\nconst IS_COLLECTION = getOrSetGlobal('IS_COLLECTION', Symbol.for('Collection'));\nfunction notifyArray(arr) {\n addToTransaction(arr[ARRAY_SIGNAL]);\n}\nfunction convertToInt(prop) {\n if (typeof prop === 'symbol') return null;\n const num = Number(prop);\n if (isNaN(num)) return null;\n return num % 1 === 0 ? num : null;\n}\nfunction safeForEach(instance, arr, store, callback, target) {\n if (target === undefined) {\n target = null;\n }\n // clone to prevent mutation\n arr = arr.slice();\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('`forEach` expects a function as first argument.');\n }\n })(typeof callback === 'function') : {};\n\n // because we retrieveLatest above we need not worry if array is mutated during iteration\n // by unloadRecord/rollbackAttributes\n // push/add/removeObject may still be problematic\n // but this is a more traditionally expected forEach bug.\n const length = arr.length; // we need to access length to ensure we are consumed\n\n for (let index = 0; index < length; index++) {\n callback.call(target, store._instanceCache.getRecord(arr[index]), index, instance);\n }\n return instance;\n}\n\n/**\n A record array is an array that contains records of a certain type (or modelName).\n The record array materializes records as needed when they are retrieved for the first\n time. You should not create record arrays yourself. Instead, an instance of\n `RecordArray` or its subclasses will be returned by your application's store\n in response to queries.\n\n This class should not be imported and instantiated by consuming applications.\n\n @class RecordArray\n @public\n*/\n\nclass IdentifierArray {\n /**\n The flag to signal a `RecordArray` is currently loading data.\n Example\n ```javascript\n let people = store.peekAll('person');\n people.isUpdating; // false\n people.update();\n people.isUpdating; // true\n ```\n @property isUpdating\n @public\n @type Boolean\n */\n\n isLoaded = true;\n isDestroying = false;\n isDestroyed = false;\n _updatingPromise = null;\n [IS_COLLECTION] = true;\n [SOURCE];\n [NOTIFY]() {\n notifyArray(this);\n }\n\n /**\n The store that created this record array.\n @property store\n @private\n @type Store\n */\n\n destroy(clear) {\n this.isDestroying = !clear;\n // changing the reference breaks the Proxy\n // this[SOURCE] = [];\n this[SOURCE].length = 0;\n this[NOTIFY]();\n this.isDestroyed = !clear;\n }\n\n // length must be on self for proxied methods to work properly\n get length() {\n return this[SOURCE].length;\n }\n static {\n decorateMethodV2(this.prototype, \"length\", [compat]);\n }\n set length(value) {\n this[SOURCE].length = value;\n }\n constructor(options) {\n // eslint-disable-next-line @typescript-eslint/no-this-alias\n const self = this;\n this.modelName = options.type;\n this.store = options.store;\n this._manager = options.manager;\n this[SOURCE] = options.identifiers;\n this[ARRAY_SIGNAL] = createSignal(this, 'length');\n const store = options.store;\n const boundFns = new Map();\n const _SIGNAL = this[ARRAY_SIGNAL];\n const PrivateState = {\n links: options.links || null,\n meta: options.meta || null\n };\n let transaction = false;\n\n // when a mutation occurs\n // we track all mutations within the call\n // and forward them as one\n\n const proxy = new NativeProxy(this[SOURCE], {\n get(target, prop, receiver) {\n const index = convertToInt(prop);\n if (_SIGNAL.shouldReset && (index !== null || SYNC_PROPS.has(prop) || isArrayGetter(prop))) {\n options.manager._syncArray(receiver);\n _SIGNAL.t = false;\n _SIGNAL.shouldReset = false;\n }\n if (index !== null) {\n const identifier = target[index];\n if (!transaction) {\n subscribe(_SIGNAL);\n }\n return identifier && store._instanceCache.getRecord(identifier);\n }\n if (prop === 'meta') return subscribe(_SIGNAL), PrivateState.meta;\n if (prop === 'links') return subscribe(_SIGNAL), PrivateState.links;\n if (prop === '[]') return subscribe(_SIGNAL), receiver;\n if (isArrayGetter(prop)) {\n let fn = boundFns.get(prop);\n if (fn === undefined) {\n if (prop === 'forEach') {\n fn = function () {\n subscribe(_SIGNAL);\n transaction = true;\n const result = safeForEach(receiver, target, store, arguments[0], arguments[1]);\n transaction = false;\n return result;\n };\n } else {\n fn = function () {\n subscribe(_SIGNAL);\n // array functions must run through Reflect to work properly\n // binding via other means will not work.\n transaction = true;\n const result = Reflect.apply(target[prop], receiver, arguments);\n transaction = false;\n return result;\n };\n }\n boundFns.set(prop, fn);\n }\n return fn;\n }\n if (isArraySetter(prop)) {\n let fn = boundFns.get(prop);\n if (fn === undefined) {\n fn = function () {\n // array functions must run through Reflect to work properly\n // binding via other means will not work.\n if (!options.allowMutation) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Mutating this array of records via ${String(prop)} is not allowed.`);\n }\n })(options.allowMutation) : {};\n return;\n }\n const args = Array.prototype.slice.call(arguments);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot start a new array transaction while a previous transaction is underway`);\n }\n })(!transaction) : {};\n transaction = true;\n const result = self[MUTATE](target, receiver, prop, args, _SIGNAL);\n transaction = false;\n return result;\n };\n boundFns.set(prop, fn);\n }\n return fn;\n }\n if (isSelfProp(self, prop)) {\n if (prop === NOTIFY || prop === ARRAY_SIGNAL || prop === SOURCE) {\n return self[prop];\n }\n let fn = boundFns.get(prop);\n if (fn) return fn;\n const outcome = self[prop];\n if (typeof outcome === 'function') {\n fn = function () {\n subscribe(_SIGNAL);\n // array functions must run through Reflect to work properly\n // binding via other means will not work.\n return Reflect.apply(outcome, receiver, arguments);\n };\n boundFns.set(prop, fn);\n return fn;\n }\n return subscribe(_SIGNAL), outcome;\n }\n return target[prop];\n },\n // FIXME: Should this get a generic like get above?\n set(target, prop, value, receiver) {\n if (prop === 'length') {\n if (!transaction && value === 0) {\n transaction = true;\n self[MUTATE](target, receiver, 'length 0', [], _SIGNAL);\n transaction = false;\n return true;\n } else if (transaction) {\n return Reflect.set(target, prop, value);\n } else {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`unexpected length set`);\n }\n })() : {};\n }\n }\n if (prop === 'links') {\n PrivateState.links = value || null;\n return true;\n }\n if (prop === 'meta') {\n PrivateState.meta = value || null;\n return true;\n }\n const index = convertToInt(prop);\n\n // we do not allow \"holey\" arrays and so if the index is\n // greater than length then we will disallow setting it.\n // however, there is a special case for \"unshift\" with more than\n // one item being inserted since current items will be moved to the\n // new indices first.\n // we \"loosely\" detect this by just checking whether we are in\n // a transaction.\n if (index === null || index > target.length) {\n if (index !== null && transaction) {\n const identifier = recordIdentifierFor(value);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot set index ${index} past the end of the array.`);\n }\n })(isStableIdentifier(identifier)) : {};\n target[index] = identifier;\n return true;\n } else if (isSelfProp(self, prop)) {\n // @ts-expect-error not all properties are indeces and we can't safely cast\n self[prop] = value;\n return true;\n }\n return false;\n }\n if (!options.allowMutation) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Mutating ${String(prop)} on this Array is not allowed.`);\n }\n })(options.allowMutation) : {};\n return false;\n }\n const original = target[index];\n const newIdentifier = extractIdentifierFromRecord$1(value);\n target[index] = newIdentifier;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Expected a record`);\n }\n })(isStableIdentifier(newIdentifier)) : {};\n // We generate \"transactions\" whenever a setter method on the array\n // is called and might bulk update multiple array cells. Fundamentally,\n // all array operations decompose into individual cell replacements.\n // e.g. a push is really a \"replace cell at next index with new value\"\n // or a splice is \"shift all values left/right by X and set out of new\n // bounds cells to undefined\"\n //\n // so, if we are in a transaction, then this is not a user generated change\n // but one generated by a setter method. In this case we want to only apply\n // the change to the target array and not call the MUTATE method.\n // If there is no transaction though, then this means the user themselves has\n // directly changed the value of a specific index and we need to thus generate\n // a mutation for that change.\n // e.g. \"arr.push(newVal)\" is handled by a \"addToRelatedRecords\" mutation within\n // a transaction.\n // while \"arr[arr.length] = newVal;\" is handled by this replace cell code path.\n if (!transaction) {\n self[MUTATE](target, receiver, 'replace cell', [index, original, newIdentifier], _SIGNAL);\n } else {\n target[index] = newIdentifier;\n }\n return true;\n },\n deleteProperty(target, prop) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Deleting keys on managed arrays is disallowed`);\n }\n })(transaction) : {};\n if (!transaction) {\n return false;\n }\n return Reflect.deleteProperty(target, prop);\n },\n getPrototypeOf() {\n return IdentifierArray.prototype;\n }\n });\n createArrayTags(proxy, _SIGNAL);\n this[NOTIFY] = this[NOTIFY].bind(proxy);\n return proxy;\n }\n\n /**\n Used to get the latest version of all of the records in this array\n from the adapter.\n Example\n ```javascript\n let people = store.peekAll('person');\n people.isUpdating; // false\n people.update().then(function() {\n people.isUpdating; // false\n });\n people.isUpdating; // true\n ```\n @method update\n @public\n */\n update() {\n if (this.isUpdating) {\n return this._updatingPromise;\n }\n this.isUpdating = true;\n const updatingPromise = this._update();\n void updatingPromise.finally(() => {\n this._updatingPromise = null;\n if (this.isDestroying || this.isDestroyed) {\n return;\n }\n this.isUpdating = false;\n });\n this._updatingPromise = updatingPromise;\n return updatingPromise;\n }\n\n /*\n Update this Array and return a promise which resolves once the update\n is finished.\n */\n _update() {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`_update cannot be used with this array`);\n }\n })(this.modelName) : {};\n // @ts-expect-error typescript is unable to handle the complexity of\n // T = unknown, modelName = string\n // T extends TypedRecordInstance, modelName = TypeFromInstance\n // both being valid options to pass through here.\n return this.store.findAll(this.modelName, {\n reload: true\n });\n }\n\n // TODO deprecate\n /**\n Saves all of the records in the `RecordArray`.\n Example\n ```javascript\n let messages = store.peekAll('message');\n messages.forEach(function(message) {\n message.hasBeenSeen = true;\n });\n messages.save();\n ```\n @method save\n @public\n @return {Promise} promise\n */\n save() {\n const promise = Promise.all(this.map(record => this.store.saveRecord(record))).then(() => this);\n return promise;\n }\n}\n\n// this will error if someone tries to call\n// A(identifierArray) since it is not configurable\n// which is preferable to the `meta` override we used\n// before which required importing all of Ember\nconst desc = {\n enumerable: true,\n configurable: false,\n get: function () {\n return this;\n }\n};\ncompat(desc);\nObject.defineProperty(IdentifierArray.prototype, '[]', desc);\ndefineSignal(IdentifierArray.prototype, 'isUpdating', false);\nclass Collection extends IdentifierArray {\n query = null;\n constructor(options) {\n super(options);\n this.query = options.query || null;\n this.isLoaded = options.isLoaded || false;\n }\n _update() {\n const {\n store,\n query\n } = this;\n\n // TODO save options from initial request?\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`update cannot be used with this array`);\n }\n })(this.modelName) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`update cannot be used with no query`);\n }\n })(query) : {};\n // @ts-expect-error typescript is unable to handle the complexity of\n // T = unknown, modelName = string\n // T extends TypedRecordInstance, modelName = TypeFromInstance\n // both being valid options to pass through here.\n const promise = store.query(this.modelName, query, {\n _recordArray: this\n });\n return promise;\n }\n destroy(clear) {\n super.destroy(clear);\n this._manager._managed.delete(this);\n this._manager._pending.delete(this);\n }\n}\n// trick the proxy \"in\" check\nCollection.prototype.query = null;\n\n// Ensure instanceof works correctly\n// Object.setPrototypeOf(IdentifierArray.prototype, Array.prototype);\n\nfunction assertRecordPassedToHasMany(record) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`All elements of a hasMany relationship must be instances of Model, you passed $${typeof record}`);\n }\n })(function () {\n try {\n recordIdentifierFor(record);\n return true;\n } catch {\n return false;\n }\n }()) : {};\n}\nfunction extractIdentifierFromRecord$1(record) {\n if (!record) {\n return null;\n }\n assertRecordPassedToHasMany(record);\n return recordIdentifierFor(record);\n}\n\n/**\n @module @ember-data/store\n*/\nconst FAKE_ARR = getOrSetGlobal('FAKE_ARR', {});\nconst SLICE_BATCH_SIZE = 1200;\n/**\n * This is a clever optimization.\n *\n * clever optimizations rarely stand the test of time, so if you're\n * ever curious or think something better is possible please benchmark\n * and discuss. The benchmark for this at the time of writing is in\n * `scripts/benchmark-push.js`\n *\n * This approach turns out to be 150x faster in Chrome and node than\n * simply using push or concat. It's highly susceptible to the specifics\n * of the batch size, and may require tuning.\n *\n * Clever optimizations should always come with a `why`. This optimization\n * exists for two reasons.\n *\n * 1) array.push(...objects) and Array.prototype.push.apply(arr, objects)\n * are susceptible to stack overflows. The size of objects at which this\n * occurs varies by environment, browser, and current stack depth and memory\n * pressure; however, it occurs in all browsers in fairly pristine conditions\n * somewhere around 125k to 200k elements. Since EmberData regularly encounters\n * arrays larger than this in size, we cannot use push.\n *\n * 2) `array.concat` or simply setting the array to a new reference is often an\n * easier approach; however, native Proxy to an array cannot swap it's target array\n * and attempts at juggling multiple array sources have proven to be victim to a number\n * of browser implementation bugs. Should these bugs be addressed then we could\n * simplify to using `concat`, however, do note this is currently 150x faster\n * than concat, and due to the overloaded signature of concat will likely always\n * be faster.\n *\n * Sincerely,\n * - runspired (Chris Thoburn) 08/21/2022\n *\n * @function fastPush\n * @internal\n * @param target the array to push into\n * @param source the items to push into target\n */\nfunction fastPush(target, source) {\n let startLength = 0;\n const newLength = source.length;\n while (newLength - startLength > SLICE_BATCH_SIZE) {\n // eslint-disable-next-line prefer-spread\n target.push.apply(target, source.slice(startLength, startLength + SLICE_BATCH_SIZE));\n startLength += SLICE_BATCH_SIZE;\n }\n // eslint-disable-next-line prefer-spread\n target.push.apply(target, source.slice(startLength));\n}\n/**\n @class RecordArrayManager\n @internal\n*/\nclass RecordArrayManager {\n constructor(options) {\n this.store = options.store;\n this.isDestroying = false;\n this.isDestroyed = false;\n this._live = new Map();\n this._managed = new Set();\n this._pending = new Map();\n this._staged = new Map();\n this._keyedArrays = new Map();\n this._identifiers = new Map();\n this._set = new Map();\n this._visibilitySet = new Map();\n this._subscription = this.store.notifications.subscribe('resource', (identifier, type) => {\n if (type === 'added') {\n this._visibilitySet.set(identifier, true);\n this.identifierAdded(identifier);\n } else if (type === 'removed') {\n this._visibilitySet.set(identifier, false);\n this.identifierRemoved(identifier);\n } else if (type === 'state') {\n this.identifierChanged(identifier);\n }\n });\n }\n _syncArray(array) {\n const pending = this._pending.get(array);\n if (!pending || this.isDestroying || this.isDestroyed) {\n return;\n }\n sync(array, pending, this._set.get(array));\n this._pending.delete(array);\n }\n\n /**\n Get the `RecordArray` for a modelName, which contains all loaded records of\n given modelName.\n @method liveArrayFor\n @internal\n @param {String} modelName\n @return {RecordArray}\n */\n liveArrayFor(type) {\n let array = this._live.get(type);\n const identifiers = [];\n const staged = this._staged.get(type);\n if (staged) {\n staged.forEach((value, key) => {\n if (value === 'add') {\n identifiers.push(key);\n }\n });\n this._staged.delete(type);\n }\n if (!array) {\n array = new IdentifierArray({\n type,\n identifiers,\n store: this.store,\n allowMutation: false,\n manager: this\n });\n this._live.set(type, array);\n this._set.set(array, new Set(identifiers));\n }\n return array;\n }\n createArray(config) {\n const options = {\n type: config.type,\n links: config.doc?.links || null,\n meta: config.doc?.meta || null,\n query: config.query || null,\n identifiers: config.identifiers || [],\n isLoaded: !!config.identifiers?.length,\n allowMutation: false,\n store: this.store,\n manager: this\n };\n const array = new Collection(options);\n this._managed.add(array);\n this._set.set(array, new Set(options.identifiers || []));\n if (config.identifiers) {\n associate(this._identifiers, array, config.identifiers);\n }\n return array;\n }\n dirtyArray(array, delta) {\n if (array === FAKE_ARR) {\n return;\n }\n const tag = array[ARRAY_SIGNAL];\n if (!tag.shouldReset) {\n tag.shouldReset = true;\n addTransactionCB(array[NOTIFY]);\n } else if (delta > 0 && !tag.t) {\n addTransactionCB(array[NOTIFY]);\n }\n }\n _getPendingFor(identifier, includeManaged, isRemove) {\n if (this.isDestroying || this.isDestroyed) {\n return;\n }\n const liveArray = this._live.get(identifier.type);\n const allPending = this._pending;\n const pending = new Map();\n if (includeManaged) {\n const managed = this._identifiers.get(identifier);\n if (managed) {\n managed.forEach(arr => {\n let changes = allPending.get(arr);\n if (!changes) {\n changes = new Map();\n allPending.set(arr, changes);\n }\n pending.set(arr, changes);\n });\n }\n }\n\n // during unloadAll we can ignore removes since we've already\n // cleared the array.\n if (liveArray && liveArray[SOURCE].length === 0 && isRemove) {\n const pendingLive = allPending.get(liveArray);\n if (!pendingLive || pendingLive.size === 0) {\n return pending;\n }\n }\n if (!liveArray) {\n // start building a changeset for when we eventually\n // do have a live array\n let changes = this._staged.get(identifier.type);\n if (!changes) {\n changes = new Map();\n this._staged.set(identifier.type, changes);\n }\n pending.set(FAKE_ARR, changes);\n } else {\n let changes = allPending.get(liveArray);\n if (!changes) {\n changes = new Map();\n allPending.set(liveArray, changes);\n }\n pending.set(liveArray, changes);\n }\n return pending;\n }\n populateManagedArray(array, identifiers, payload) {\n this._pending.delete(array);\n const source = array[SOURCE];\n const old = source.slice();\n source.length = 0;\n fastPush(source, identifiers);\n this._set.set(array, new Set(identifiers));\n notifyArray(array);\n array.meta = payload.meta || null;\n array.links = payload.links || null;\n array.isLoaded = true;\n disassociate(this._identifiers, array, old);\n associate(this._identifiers, array, identifiers);\n }\n identifierAdded(identifier) {\n const changeSets = this._getPendingFor(identifier, false);\n if (changeSets) {\n changeSets.forEach((changes, array) => {\n const existing = changes.get(identifier);\n if (existing === 'del') {\n changes.delete(identifier);\n } else {\n changes.set(identifier, 'add');\n this.dirtyArray(array, changes.size);\n }\n });\n }\n }\n identifierRemoved(identifier) {\n const changeSets = this._getPendingFor(identifier, true, true);\n if (changeSets) {\n changeSets.forEach((changes, array) => {\n const existing = changes.get(identifier);\n if (existing === 'add') {\n changes.delete(identifier);\n } else {\n changes.set(identifier, 'del');\n this.dirtyArray(array, changes.size);\n }\n });\n }\n }\n identifierChanged(identifier) {\n const newState = this.store._instanceCache.recordIsLoaded(identifier, true);\n\n // if the change matches the most recent direct added/removed\n // state, then we can ignore it\n if (this._visibilitySet.get(identifier) === newState) {\n return;\n }\n if (newState) {\n this.identifierAdded(identifier);\n } else {\n this.identifierRemoved(identifier);\n }\n }\n clear(isClear = true) {\n this._live.forEach(array => array.destroy(isClear));\n this._managed.forEach(array => array.destroy(isClear));\n this._managed.clear();\n this._identifiers.clear();\n this._pending.clear();\n this._set.forEach(set => set.clear());\n this._visibilitySet.clear();\n }\n destroy() {\n this.isDestroying = true;\n this.clear(false);\n this._live.clear();\n this.isDestroyed = true;\n this.store.notifications.unsubscribe(this._subscription);\n }\n}\nfunction associate(ArraysCache, array, identifiers) {\n for (let i = 0; i < identifiers.length; i++) {\n const identifier = identifiers[i];\n let cache = ArraysCache.get(identifier);\n if (!cache) {\n cache = new Set();\n ArraysCache.set(identifier, cache);\n }\n cache.add(array);\n }\n}\nfunction disassociate(ArraysCache, array, identifiers) {\n for (let i = 0; i < identifiers.length; i++) {\n disassociateIdentifier(ArraysCache, array, identifiers[i]);\n }\n}\nfunction disassociateIdentifier(ArraysCache, array, identifier) {\n const cache = ArraysCache.get(identifier);\n if (cache) {\n cache.delete(array);\n }\n}\nfunction sync(array, changes, arraySet) {\n const state = array[SOURCE];\n const adds = [];\n const removes = [];\n changes.forEach((value, key) => {\n if (value === 'add') {\n // likely we want to keep a Set along-side\n if (arraySet.has(key)) {\n return;\n }\n adds.push(key);\n arraySet.add(key);\n } else {\n if (arraySet.has(key)) {\n removes.push(key);\n arraySet.delete(key);\n }\n }\n });\n if (removes.length) {\n if (removes.length === state.length) {\n state.length = 0;\n // changing the reference breaks the Proxy\n // state = array[SOURCE] = [];\n } else {\n removes.forEach(i => {\n const index = state.indexOf(i);\n if (index !== -1) {\n state.splice(index, 1);\n arraySet.delete(i);\n }\n });\n }\n }\n if (adds.length) {\n fastPush(state, adds);\n // changing the reference breaks the Proxy\n // else we could do this\n /*\n if (state.length === 0) {\n array[SOURCE] = adds;\n } else {\n array[SOURCE] = state.concat(adds);\n }\n */\n }\n}\n\n/**\n * @module @ember-data/store\n */\n\nconst Touching = getOrSetGlobal('Touching', Symbol('touching'));\nconst RequestPromise = getOrSetGlobal('RequestPromise', Symbol('promise'));\nconst EMPTY_ARR = macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? Object.freeze([]) : [];\nfunction hasRecordIdentifier(op) {\n return 'recordIdentifier' in op;\n}\n\n/**\n * The RequestStateService is used to track the state of requests\n * for fetching or updating known resource identifies that are inflight.\n *\n * @class RequestStateService\n * @public\n */\nclass RequestStateService {\n _pending = new Map();\n _done = new Map();\n _subscriptions = new Map();\n _toFlush = [];\n _store;\n constructor(store) {\n this._store = store;\n }\n _clearEntries(identifier) {\n this._done.delete(identifier);\n }\n _enqueue(promise, queryRequest) {\n const query = queryRequest.data[0];\n if (hasRecordIdentifier(query)) {\n const identifier = query.recordIdentifier;\n const type = query.op === 'saveRecord' ? 'mutation' : 'query';\n if (!this._pending.has(identifier)) {\n this._pending.set(identifier, []);\n }\n const request = {\n state: 'pending',\n request: queryRequest,\n type\n };\n request[Touching] = [query.recordIdentifier];\n request[RequestPromise] = promise;\n this._pending.get(identifier).push(request);\n this._triggerSubscriptions(request);\n return promise.then(result => {\n this._dequeue(identifier, request);\n const finalizedRequest = {\n state: 'fulfilled',\n request: queryRequest,\n type,\n response: {\n data: result\n }\n };\n finalizedRequest[Touching] = request[Touching];\n this._addDone(finalizedRequest);\n this._triggerSubscriptions(finalizedRequest);\n return result;\n }, error => {\n this._dequeue(identifier, request);\n const finalizedRequest = {\n state: 'rejected',\n request: queryRequest,\n type,\n response: {\n data: error\n }\n };\n finalizedRequest[Touching] = request[Touching];\n this._addDone(finalizedRequest);\n this._triggerSubscriptions(finalizedRequest);\n throw error;\n });\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n {\n throw new Error(`Expected a well formed query`);\n }\n })() : {};\n }\n _triggerSubscriptions(req) {\n if (req.state === 'pending') {\n this._flushRequest(req);\n return;\n }\n this._toFlush.push(req);\n if (this._toFlush.length === 1) {\n this._store.notifications._onNextFlush(() => {\n this._flush();\n });\n }\n }\n _flush() {\n this._toFlush.forEach(req => {\n this._flushRequest(req);\n });\n this._toFlush = [];\n }\n _flushRequest(req) {\n req[Touching].forEach(identifier => {\n const subscriptions = this._subscriptions.get(identifier);\n if (subscriptions) {\n subscriptions.forEach(callback => callback(req));\n }\n });\n }\n _dequeue(identifier, request) {\n const pending = this._pending.get(identifier);\n this._pending.set(identifier, pending.filter(req => req !== request));\n }\n _addDone(request) {\n request[Touching].forEach(identifier => {\n // TODO add support for multiple\n const requestDataOp = request.request.data[0].op;\n let requests = this._done.get(identifier);\n if (requests) {\n requests = requests.filter(req => {\n // TODO add support for multiple\n let data;\n if (Array.isArray(req.request.data)) {\n data = req.request.data[0];\n } else {\n data = req.request.data;\n }\n return data.op !== requestDataOp;\n });\n }\n requests = requests || [];\n requests.push(request);\n this._done.set(identifier, requests);\n });\n }\n\n /**\n * Subscribe to requests for a given resource identity.\n *\n * The callback will receive the current state of the request.\n *\n * ```ts\n * interface RequestState {\n * state: 'pending' | 'fulfilled' | 'rejected';\n * type: 'query' | 'mutation';\n * request: Request;\n * response?: { data: unknown };\n * }\n * ```\n *\n * Note: It should be considered dangerous to use this API for more than simple\n * state derivation or debugging. The `request` and `response` properties are poorly\n * spec'd and may change unexpectedly when shifting what Handlers are in use or how\n * requests are issued from the Store.\n *\n * We expect to revisit this API in the near future as we continue to refine the\n * RequestManager ergonomics, as a simpler but more powerful direct integration\n * with the RequestManager for these purposes is likely to be a better long-term\n * design.\n *\n * @method subscribeForRecord\n * @public\n * @param {StableRecordIdentifier} identifier\n * @param {(state: RequestState) => void} callback\n */\n subscribeForRecord(identifier, callback) {\n let subscriptions = this._subscriptions.get(identifier);\n if (!subscriptions) {\n subscriptions = [];\n this._subscriptions.set(identifier, subscriptions);\n }\n subscriptions.push(callback);\n }\n\n /**\n * Retrieve all active requests for a given resource identity.\n *\n * @method getPendingRequestsForRecord\n * @public\n * @param {StableRecordIdentifier} identifier\n * @return {RequestState[]} an array of request states for any pending requests for the given identifier\n */\n getPendingRequestsForRecord(identifier) {\n return this._pending.get(identifier) || EMPTY_ARR;\n }\n\n /**\n * Retrieve the last completed request for a given resource identity.\n *\n * @method getLastRequestForRecord\n * @public\n * @param {StableRecordIdentifier} identifier\n * @return {RequestState | null} the state of the most recent request for the given identifier\n */\n getLastRequestForRecord(identifier) {\n const requests = this._done.get(identifier);\n if (requests) {\n return requests[requests.length - 1];\n }\n return null;\n }\n}\nfunction isNonEmptyString(str) {\n return Boolean(str && typeof str === 'string');\n}\nfunction constructResource(type, id, lid) {\n if (typeof type === 'object' && type !== null) {\n const resource = type;\n if (isStableIdentifier(resource)) {\n return resource;\n }\n if ('id' in resource) {\n resource.id = coerceId(resource.id);\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('Expected either id or lid to be a valid string');\n }\n })('id' in resource && isNonEmptyString(resource.id) || isNonEmptyString(resource.lid)) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('if id is present, the type must be a string');\n }\n })(!('id' in resource) || typeof resource.type === 'string') : {};\n return resource;\n } else {\n const trueId = coerceId(id);\n if (!isNonEmptyString(trueId)) {\n if (isNonEmptyString(lid)) {\n return {\n lid\n };\n }\n throw new Error('Expected either id or lid to be a valid string');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('type must be a string');\n }\n })(typeof type === 'string') : {};\n if (isNonEmptyString(lid)) {\n return {\n type,\n id: trueId,\n lid\n };\n }\n return {\n type,\n id: trueId\n };\n }\n}\n\n/**\n @module @ember-data/store\n */\n// this import location is deprecated but breaks in 4.8 and older\n\n// `AwaitedKeys` is needed here to resolve any promise types like `PromiseBelongsTo`.\n\n/**\n * Currently only records that extend object can be created via\n * store.createRecord. This is a limitation of the current API,\n * but can be worked around by creating a new identifier, running\n * the cache.clientDidCreate method, and then peeking the record\n * for the identifier.\n *\n * To assign primary key to a record during creation, only `id` will\n * work correctly for `store.createRecord`, other primary key may be\n * handled by updating the record after creation or using the flow\n * described above.\n *\n * TODO: These are limitations we want to (and can) address. If you\n * have need of lifting these limitations, please open an issue.\n *\n * @typedoc\n */\n\n/**\n * A Store coordinates interaction between your application, a [Cache](https://api.emberjs.com/ember-data/release/classes/%3CInterface%3E%20Cache),\n * and sources of data (such as your API or a local persistence layer)\n * accessed via a [RequestManager](https://github.com/emberjs/data/tree/main/packages/request).\n *\n * ```app/services/store.js\n * import Store from '@ember-data/store';\n *\n * export default class extends Store {}\n * ```\n *\n * Most Applications will only have a single `Store` configured as a Service\n * in this manner. However, setting up multiple stores is possible, including using\n * each as a unique service or within a specific context.\n *\n\n @class Store\n @public\n*/\n// eslint-disable-next-line @typescript-eslint/no-extraneous-class\nconst EmptyClass = class {\n // eslint-disable-next-line @typescript-eslint/no-useless-constructor\n constructor(args) {}\n};\nconst BaseClass = macroCondition(dependencySatisfies('ember-source', '*')) ? macroCondition(getGlobalConfig().WarpDrive.deprecations.DEPRECATE_STORE_EXTENDS_EMBER_OBJECT) ? importSync('@ember/object') : EmptyClass : EmptyClass;\nif (BaseClass !== EmptyClass) {\n deprecate(`The Store class extending from EmberObject is deprecated.\nPlease remove usage of EmberObject APIs and mark your class as not requiring it.\n\nTo mark the class as no longer extending from EmberObject, in ember-cli-build.js\nset the following config:\n\n\\`\\`\\`js\nconst app = new EmberApp(defaults, {\n emberData: {\n deprecations: {\n DEPRECATE_STORE_EXTENDS_EMBER_OBJECT: false\n }\n }\n});\n\\`\\`\\`\n`, false, {\n id: 'ember-data:deprecate-store-extends-ember-object',\n until: '6.0',\n for: 'ember-data',\n since: {\n available: '5.4',\n enabled: '5.4'\n }\n });\n}\nclass Store extends BaseClass {\n /**\n * Provides access to the NotificationManager associated\n * with this Store instance.\n *\n * The NotificationManager can be used to subscribe to\n * changes to the cache.\n *\n * @property {NotificationManager} notifications\n * @public\n */\n\n /**\n * Provides access to the SchemaService instance\n * for this Store instance.\n *\n * The SchemaService can be used to query for\n * information about the schema of a resource.\n *\n * @property {SchemaService} schema\n * @public\n */\n get schema() {\n if (!this._schema) {\n this._schema = this.createSchemaService();\n }\n return this._schema;\n }\n\n /**\n * Provides access to the IdentifierCache instance\n * for this store.\n *\n * The IdentifierCache can be used to generate or\n * retrieve a stable unique identifier for any resource.\n *\n * @property {IdentifierCache} identifierCache\n * @public\n */\n\n /**\n * Provides access to the requestManager instance associated\n * with this Store instance.\n *\n * When using `ember-data` this property is automatically\n * set to an instance of `RequestManager`. When not using `ember-data`\n * you must configure this property yourself, either by declaring\n * it as a service or by initializing it.\n *\n * ```ts\n * import Store, { CacheHandler } from '@ember-data/store';\n * import RequestManager from '@ember-data/request';\n * import Fetch from '@ember-data/request/fetch';\n *\n * class extends Store {\n * constructor() {\n * super(...arguments);\n * this.requestManager = new RequestManager();\n * this.requestManager.use([Fetch]);\n * this.requestManager.useCache(CacheHandler);\n * }\n * }\n * ```\n *\n * @public\n * @property {RequestManager} requestManager\n */\n\n /**\n * A Property which an App may set to provide a CachePolicy\n * to control when a cached request becomes stale.\n *\n * Note, when defined, these methods will only be invoked if a\n * cache key exists for the request, either because the request\n * contains `cacheOptions.key` or because the [IdentifierCache](/ember-data/release/classes/IdentifierCache)\n * was able to generate a key for the request using the configured\n * [generation method](/ember-data/release/functions/@ember-data%2Fstore/setIdentifierGenerationMethod).\n *\n * `isSoftExpired` will only be invoked if `isHardExpired` returns `false`.\n *\n * ```ts\n * store.lifetimes = {\n * // make the request and ignore the current cache state\n * isHardExpired(identifier: StableDocumentIdentifier): boolean {\n * return false;\n * }\n *\n * // make the request in the background if true, return cache state\n * isSoftExpired(identifier: StableDocumentIdentifier): boolean {\n * return false;\n * }\n * }\n * ```\n *\n * @public\n * @property {CachePolicy|undefined} lifetimes\n */\n\n // Private\n\n // DEBUG-only properties\n\n get isDestroying() {\n return this._isDestroying;\n }\n set isDestroying(value) {\n this._isDestroying = value;\n }\n get isDestroyed() {\n return this._isDestroyed;\n }\n set isDestroyed(value) {\n this._isDestroyed = value;\n }\n\n /**\n @method init\n @private\n */\n constructor(createArgs) {\n super(createArgs);\n Object.assign(this, createArgs);\n this.identifierCache = new IdentifierCache();\n this.notifications = new NotificationManager(this);\n\n // private but maybe useful to be here, somewhat intimate\n this.recordArrayManager = new RecordArrayManager({\n store: this\n });\n\n // private\n this._requestCache = new RequestStateService(this);\n this._instanceCache = new InstanceCache(this);\n this._documentCache = new Map();\n this.isDestroying = false;\n this.isDestroyed = false;\n }\n _run(cb) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`EmberData should never encounter a nested run`);\n }\n })(!this._cbs) : {};\n const _cbs = this._cbs = {};\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n try {\n cb();\n if (_cbs.coalesce) {\n _cbs.coalesce();\n }\n if (_cbs.sync) {\n _cbs.sync();\n }\n if (_cbs.notify) {\n _cbs.notify();\n }\n } finally {\n this._cbs = null;\n }\n } else {\n cb();\n if (_cbs.coalesce) {\n _cbs.coalesce();\n }\n if (_cbs.sync) {\n _cbs.sync();\n }\n if (_cbs.notify) {\n _cbs.notify();\n }\n this._cbs = null;\n }\n }\n _join(cb) {\n if (this._cbs) {\n cb();\n } else {\n this._run(cb);\n }\n }\n _schedule(name, cb) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`EmberData expects to schedule only when there is an active run`);\n }\n })(!!this._cbs) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`EmberData expects only one flush per queue name, cannot schedule ${name}`);\n }\n })(!this._cbs[name]) : {};\n this._cbs[name] = cb;\n }\n\n /**\n * Retrieve the RequestStateService instance\n * associated with this Store.\n *\n * This can be used to query the status of requests\n * that have been initiated for a given identifier.\n *\n * @method getRequestStateService\n * @return {RequestStateService}\n * @public\n */\n getRequestStateService() {\n return this._requestCache;\n }\n _getAllPending() {\n if (macroCondition(getGlobalConfig().WarpDrive.env.TESTING)) {\n const all = [];\n const pending = this._requestCache._pending;\n pending.forEach(requests => {\n all.push(...requests.map(v => v[RequestPromise]));\n });\n this.requestManager._pending.forEach(v => all.push(v));\n const promise = Promise.allSettled(all);\n promise.length = all.length;\n return promise;\n }\n }\n\n /**\n * Issue a request via the configured RequestManager,\n * inserting the response into the cache and handing\n * back a Future which resolves to a ResponseDocument\n *\n * ## Cache Keys\n *\n * Only GET requests with a url or requests with an explicit\n * cache key (`cacheOptions.key`) will have the request result\n * and document cached.\n *\n * The cache key used is `requestConfig.cacheOptions.key`\n * if present, falling back to `requestConfig.url`.\n *\n * Params are not serialized as part of the cache-key, so\n * either ensure they are already in the url or utilize\n * `requestConfig.cacheOptions.key`. For queries issued\n * via the `POST` method `requestConfig.cacheOptions.key`\n * MUST be supplied for the document to be cached.\n *\n * ## Requesting Without a Cache Key\n *\n * Resource data within the request is always updated in the cache,\n * regardless of whether a cache key is present for the request.\n *\n * ## Fulfilling From Cache\n *\n * When a cache-key is determined, the request may fulfill\n * from cache provided the cache is not stale.\n *\n * Cache staleness is determined by the configured CachePolicy\n * with priority given to the `cacheOptions.reload` and\n * `cacheOptions.backgroundReload` on the request if present.\n *\n * If the cache data has soft expired or the request asks for a background\n * reload, the request will fulfill from cache if possible and\n * make a non-blocking request in the background to update the cache.\n *\n * If the cache data has hard expired or the request asks for a reload,\n * the request will not fulfill from cache and will make a blocking\n * request to update the cache.\n *\n * ## The Response\n *\n * The primary difference between `requestManager.request` and `store.request`\n * is that `store.request` will attempt to hydrate the response content into\n * a response Document containing RecordInstances.\n *\n * @method request\n * @param {StoreRequestInput} requestConfig\n * @return {Future}\n * @public\n */\n request(requestConfig) {\n // we lazily set the cache handler when we issue the first request\n // because constructor doesn't allow for this to run after\n // the user has had the chance to set the prop.\n const opts = {\n store: this,\n [EnableHydration]: true\n };\n if (requestConfig.records) {\n const identifierCache = this.identifierCache;\n opts.records = requestConfig.records.map(r => identifierCache.getOrCreateRecordIdentifier(r));\n }\n if (macroCondition(getGlobalConfig().WarpDrive.env.TESTING)) {\n if (this.DISABLE_WAITER) {\n opts.disableTestWaiter = typeof requestConfig.disableTestWaiter === 'boolean' ? requestConfig.disableTestWaiter : true;\n }\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_REQUESTS)) {\n let options;\n try {\n options = JSON.parse(JSON.stringify(requestConfig));\n } catch {\n options = requestConfig;\n }\n // eslint-disable-next-line no-console\n console.log(`request: [[START]] ${requestConfig.op && !requestConfig.url ? '(LEGACY) ' : ''}${requestConfig.op || ''} ${requestConfig.url || ''} ${requestConfig.method || ''}`, options);\n }\n const request = Object.assign({}, requestConfig, opts);\n const future = this.requestManager.request(request);\n future.onFinalize(() => {\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_REQUESTS)) {\n // eslint-disable-next-line no-console\n console.log(`request: [[FINALIZE]] ${requestConfig.op && !requestConfig.url ? '(LEGACY) ' : ''}${requestConfig.op || ''} ${requestConfig.url || ''} ${requestConfig.method || ''}`);\n }\n // skip flush for legacy belongsTo\n if (requestConfig.op === 'findBelongsTo' && !requestConfig.url) {\n return;\n }\n this.notifications._flush();\n });\n return future;\n }\n\n /**\n * A hook which an app or addon may implement. Called when\n * the Store is attempting to create a Record Instance for\n * a resource.\n *\n * This hook can be used to select or instantiate any desired\n * mechanism of presenting cache data to the ui for access\n * mutation, and interaction.\n *\n * @method instantiateRecord (hook)\n * @param identifier\n * @param createRecordArgs\n * @param recordDataFor deprecated use this.cache\n * @param notificationManager deprecated use this.notifications\n * @return A record instance\n * @public\n */\n\n /**\n * A hook which an app or addon may implement. Called when\n * the Store is destroying a Record Instance. This hook should\n * be used to teardown any custom record instances instantiated\n * with `instantiateRecord`.\n *\n * @method teardownRecord (hook)\n * @public\n * @param record\n */\n\n /**\n Returns the schema for a particular resource type (modelName).\n When used with Model from @ember-data/model the return is the model class,\n but this is not guaranteed.\n If looking to query attribute or relationship information it is\n recommended to use `getSchemaDefinitionService` instead. This method\n should be considered legacy and exists primarily to continue to support\n Adapter/Serializer APIs which expect it's return value in their method\n signatures.\n The class of a model might be useful if you want to get a list of all the\n relationship names of the model, see\n [`relationshipNames`](/ember-data/release/classes/Model?anchor=relationshipNames)\n for example.\n @method modelFor\n @public\n @deprecated\n @param {string} type\n @return {ModelSchema}\n */\n\n modelFor(type) {\n // FIXME add deprecation and deprecation stripping\n // FIXME/TODO update RFC to remove this method\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyedStoreOnly(this, 'modelFor');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass to the store's modelFor method`);\n }\n })(typeof type === 'string' && type.length) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`No model was found for '${type}' and no schema handles the type`);\n }\n })(this.schema.hasResource({\n type\n })) : {};\n return getShimClass(this, type);\n }\n\n /**\n Create a new record in the current store. The properties passed\n to this method are set on the newly created record.\n To create a new instance of a `Post`:\n ```js\n store.createRecord('post', {\n title: 'Ember is awesome!'\n });\n ```\n To create a new instance of a `Post` that has a relationship with a `User` record:\n ```js\n let user = this.store.peekRecord('user', '1');\n store.createRecord('post', {\n title: 'Ember is awesome!',\n user: user\n });\n ```\n @method createRecord\n @public\n @param {String} type the name of the resource\n @param {Object} inputProperties a hash of properties to set on the\n newly created record.\n @return {Model} record\n */\n\n createRecord(type, inputProperties) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'createRecord');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a model name to the store's createRecord method`);\n }\n })(type) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Passing classes to store methods has been removed. Please pass a dasherized string instead of ${type}`);\n }\n })(typeof type === 'string') : {};\n\n // This is wrapped in a `run.join` so that in test environments users do not need to manually wrap\n // calls to `createRecord`. The run loop usage here is because we batch the joining and updating\n // of record-arrays via ember's run loop, not our own.\n //\n // to remove this, we would need to move to a new `async` API.\n let record;\n this._join(() => {\n const normalizedModelName = normalizeModelName(type);\n const properties = {\n ...inputProperties\n };\n\n // If the passed properties do not include a primary key,\n // give the adapter an opportunity to generate one. Typically,\n // client-side ID generators will use something like uuid.js\n // to avoid conflicts.\n let id = null;\n if (properties.id === null || properties.id === undefined) {\n const adapter = this.adapterFor?.(normalizedModelName, true);\n if (adapter && adapter.generateIdForRecord) {\n id = properties.id = coerceId(adapter.generateIdForRecord(this, normalizedModelName, properties));\n } else {\n id = properties.id = null;\n }\n } else {\n id = properties.id = coerceId(properties.id);\n }\n const resource = {\n type: normalizedModelName,\n id\n };\n if (resource.id) {\n const identifier = this.identifierCache.peekRecordIdentifier(resource);\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`The id ${String(properties.id)} has already been used with another '${normalizedModelName}' record.`);\n }\n })(!identifier) : {};\n }\n const identifier = this.identifierCache.createIdentifierForNewRecord(resource);\n const cache = this.cache;\n const createOptions = normalizeProperties(this, identifier, properties);\n const resultProps = cache.clientDidCreate(identifier, createOptions);\n record = this._instanceCache.getRecord(identifier, resultProps);\n });\n return record;\n }\n\n /**\n For symmetry, a record can be deleted via the store.\n Example\n ```javascript\n let post = store.createRecord('post', {\n title: 'Ember is awesome!'\n });\n store.deleteRecord(post);\n ```\n @method deleteRecord\n @public\n @param {unknown} record\n */\n deleteRecord(record) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'deleteRecord');\n }\n const identifier = peekRecordIdentifier(record);\n const cache = this.cache;\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected the record to be connected to a cache`);\n }\n })(identifier) : {};\n this._join(() => {\n cache.setIsDeleted(identifier, true);\n if (cache.isNew(identifier)) {\n this._instanceCache.unloadRecord(identifier);\n }\n });\n }\n\n /**\n For symmetry, a record can be unloaded via the store.\n This will cause the record to be destroyed and freed up for garbage collection.\n Example\n ```javascript\n store.findRecord('post', '1').then(function(post) {\n store.unloadRecord(post);\n });\n ```\n @method unloadRecord\n @public\n @param {Model} record\n */\n unloadRecord(record) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'unloadRecord');\n }\n const identifier = peekRecordIdentifier(record);\n if (identifier) {\n this._instanceCache.unloadRecord(identifier);\n }\n }\n\n /**\n This method returns a record for a given identifier or type and id combination.\n The `findRecord` method will always resolve its promise with the same\n object for a given identifier or type and `id`.\n The `findRecord` method will always return a **promise** that will be\n resolved with the record.\n **Example 1**\n ```app/routes/post.js\n export default class PostRoute extends Route {\n model({ post_id }) {\n return this.store.findRecord('post', post_id);\n }\n }\n ```\n **Example 2**\n `findRecord` can be called with a single identifier argument instead of the combination\n of `type` (modelName) and `id` as separate arguments. You may recognize this combo as\n the typical pairing from [JSON:API](https://jsonapi.org/format/#document-resource-object-identification)\n ```app/routes/post.js\n export default class PostRoute extends Route {\n model({ post_id: id }) {\n return this.store.findRecord({ type: 'post', id });\n }\n }\n ```\n **Example 3**\n If you have previously received an lid via an Identifier for this record, and the record\n has already been assigned an id, you can find the record again using just the lid.\n ```app/routes/post.js\n store.findRecord({ lid });\n ```\n If the record is not yet available, the store will ask the adapter's `findRecord`\n method to retrieve and supply the necessary data. If the record is already present\n in the store, it depends on the reload behavior _when_ the returned promise\n resolves.\n ### Preloading\n You can optionally `preload` specific attributes and relationships that you know of\n by passing them via the passed `options`.\n For example, if your Ember route looks like `/posts/1/comments/2` and your API route\n for the comment also looks like `/posts/1/comments/2` if you want to fetch the comment\n without also fetching the post you can pass in the post to the `findRecord` call:\n ```app/routes/post-comments.js\n export default class PostRoute extends Route {\n model({ post_id, comment_id: id }) {\n return this.store.findRecord({ type: 'comment', id, { preload: { post: post_id }} });\n }\n }\n ```\n In your adapter you can then access this id without triggering a network request via the\n snapshot:\n ```app/adapters/application.js\n export default class Adapter {\n findRecord(store, schema, id, snapshot) {\n let type = schema.modelName;\n if (type === 'comment')\n let postId = snapshot.belongsTo('post', { id: true });\n return fetch(`./posts/${postId}/comments/${id}`)\n .then(response => response.json())\n }\n }\n static create() {\n return new this();\n }\n }\n ```\n This could also be achieved by supplying the post id to the adapter via the adapterOptions\n property on the options hash.\n ```app/routes/post-comments.js\n export default class PostRoute extends Route {\n model({ post_id, comment_id: id }) {\n return this.store.findRecord({ type: 'comment', id, { adapterOptions: { post: post_id }} });\n }\n }\n ```\n ```app/adapters/application.js\n export default class Adapter {\n findRecord(store, schema, id, snapshot) {\n let type = schema.modelName;\n if (type === 'comment')\n let postId = snapshot.adapterOptions.post;\n return fetch(`./posts/${postId}/comments/${id}`)\n .then(response => response.json())\n }\n }\n static create() {\n return new this();\n }\n }\n ```\n If you have access to the post model you can also pass the model itself to preload:\n ```javascript\n let post = await store.findRecord('post', '1');\n let comment = await store.findRecord('comment', '2', { post: myPostModel });\n ```\n ### Reloading\n The reload behavior is configured either via the passed `options` hash or\n the result of the adapter's `shouldReloadRecord`.\n If `{ reload: true }` is passed or `adapter.shouldReloadRecord` evaluates\n to `true`, then the returned promise resolves once the adapter returns\n data, regardless if the requested record is already in the store:\n ```js\n store.push({\n data: {\n id: 1,\n type: 'post',\n revision: 1\n }\n });\n // adapter#findRecord resolves with\n // [\n // {\n // id: 1,\n // type: 'post',\n // revision: 2\n // }\n // ]\n store.findRecord('post', '1', { reload: true }).then(function(post) {\n post.revision; // 2\n });\n ```\n If no reload is indicated via the above mentioned ways, then the promise\n immediately resolves with the cached version in the store.\n ### Background Reloading\n Optionally, if `adapter.shouldBackgroundReloadRecord` evaluates to `true`,\n then a background reload is started, which updates the records' data, once\n it is available:\n ```js\n // app/adapters/post.js\n import ApplicationAdapter from \"./application\";\n export default class PostAdapter extends ApplicationAdapter {\n shouldReloadRecord(store, snapshot) {\n return false;\n },\n shouldBackgroundReloadRecord(store, snapshot) {\n return true;\n }\n });\n // ...\n store.push({\n data: {\n id: 1,\n type: 'post',\n revision: 1\n }\n });\n let blogPost = store.findRecord('post', '1').then(function(post) {\n post.revision; // 1\n });\n // later, once adapter#findRecord resolved with\n // [\n // {\n // id: 1,\n // type: 'post',\n // revision: 2\n // }\n // ]\n blogPost.revision; // 2\n ```\n If you would like to force or prevent background reloading, you can set a\n boolean value for `backgroundReload` in the options object for\n `findRecord`.\n ```app/routes/post/edit.js\n export default class PostEditRoute extends Route {\n model(params) {\n return this.store.findRecord('post', params.post_id, { backgroundReload: false });\n }\n }\n ```\n If you pass an object on the `adapterOptions` property of the options\n argument it will be passed to your adapter via the snapshot\n ```app/routes/post/edit.js\n export default class PostEditRoute extends Route {\n model(params) {\n return this.store.findRecord('post', params.post_id, {\n adapterOptions: { subscribe: false }\n });\n }\n }\n ```\n ```app/adapters/post.js\n import MyCustomAdapter from './custom-adapter';\n export default class PostAdapter extends MyCustomAdapter {\n findRecord(store, type, id, snapshot) {\n if (snapshot.adapterOptions.subscribe) {\n // ...\n }\n // ...\n }\n }\n ```\n See [peekRecord](../methods/peekRecord?anchor=peekRecord) to get the cached version of a record.\n ### Retrieving Related Model Records\n If you use an adapter such as Ember's default\n [`JSONAPIAdapter`](/ember-data/release/classes/JSONAPIAdapter)\n that supports the [JSON API specification](http://jsonapi.org/) and if your server\n endpoint supports the use of an\n ['include' query parameter](http://jsonapi.org/format/#fetching-includes),\n you can use `findRecord()` or `findAll()` to automatically retrieve additional records related to\n the one you request by supplying an `include` parameter in the `options` object.\n For example, given a `post` model that has a `hasMany` relationship with a `comment`\n model, when we retrieve a specific post we can have the server also return that post's\n comments in the same request:\n ```app/routes/post.js\n export default class PostRoute extends Route {\n model(params) {\n return this.store.findRecord('post', params.post_id, { include: 'comments' });\n }\n }\n ```\n ```app/adapters/application.js\n export default class Adapter {\n findRecord(store, schema, id, snapshot) {\n let type = schema.modelName;\n if (type === 'post')\n let includes = snapshot.adapterOptions.include;\n return fetch(`./posts/${postId}?include=${includes}`)\n .then(response => response.json())\n }\n }\n static create() {\n return new this();\n }\n }\n ```\n In this case, the post's comments would then be available in your template as\n `model.comments`.\n Multiple relationships can be requested using an `include` parameter consisting of a\n comma-separated list (without white-space) while nested relationships can be specified\n using a dot-separated sequence of relationship names. So to request both the post's\n comments and the authors of those comments the request would look like this:\n ```app/routes/post.js\n export default class PostRoute extends Route {\n model(params) {\n return this.store.findRecord('post', params.post_id, { include: 'comments,comments.author' });\n }\n }\n ```\n ### Retrieving Specific Fields by Type\n If your server endpoint supports the use of a ['fields' query parameter](https://jsonapi.org/format/#fetching-sparse-fieldsets),\n you can use pass those fields through to your server. At this point in time, this requires a few manual steps on your part.\n 1. Implement `buildQuery` in your adapter.\n ```app/adapters/application.js\n buildQuery(snapshot) {\n let query = super.buildQuery(...arguments);\n let { fields } = snapshot.adapterOptions;\n if (fields) {\n query.fields = fields;\n }\n return query;\n }\n ```\n 2. Then pass through the applicable fields to your `findRecord` request.\n Given a `post` model with attributes body, title, publishDate and meta, you can retrieve a filtered list of attributes.\n ```app/routes/post.js\n export default class extends Route {\n model(params) {\n return this.store.findRecord('post', params.post_id, { adapterOptions: { fields: { post: 'body,title' } });\n }\n }\n ```\n Moreover, you can filter attributes on related models as well. If a `post` has a `belongsTo` relationship to a user,\n just include the relationship key and attributes.\n ```app/routes/post.js\n export default class extends Route {\n model(params) {\n return this.store.findRecord('post', params.post_id, { adapterOptions: { fields: { post: 'body,title', user: 'name,email' } });\n }\n }\n ```\n @since 1.13.0\n @method findRecord\n @public\n @param {String|object} type - either a string representing the name of the resource or a ResourceIdentifier object containing both the type (a string) and the id (a string) for the record or an lid (a string) of an existing record\n @param {(String|Integer|Object)} id - optional object with options for the request only if the first param is a ResourceIdentifier, else the string id of the record to be retrieved\n @param {Object} [options] - if the first param is a string this will be the optional options for the request. See examples for available options.\n @return {Promise} promise\n */\n\n findRecord(resource, id, options) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'findRecord');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a modelName or resource identifier as the first argument to the store's findRecord method`);\n }\n })(resource) : {};\n if (isMaybeIdentifier(resource)) {\n options = id;\n } else {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Passing classes to store methods has been removed. Please pass a dasherized string instead of ${resource}`);\n }\n })(typeof resource === 'string') : {};\n const type = normalizeModelName(resource);\n const normalizedId = ensureStringId(id);\n resource = constructResource(type, normalizedId);\n }\n const identifier = this.identifierCache.getOrCreateRecordIdentifier(resource);\n options = options || {};\n if (options.preload) {\n // force reload if we preload to ensure we don't resolve the promise\n // until we are complete, else we will end up background-reloading\n // even for initial load.\n if (!this._instanceCache.recordIsLoaded(identifier)) {\n options.reload = true;\n }\n this._join(() => {\n preloadData(this, identifier, options.preload);\n });\n }\n const promise = this.request({\n op: 'findRecord',\n data: {\n record: identifier,\n options\n },\n cacheOptions: {\n [SkipCache]: true\n }\n });\n return promise.then(document => {\n return document.content;\n });\n }\n\n /**\n Get the reference for the specified record.\n Example\n ```javascript\n let userRef = store.getReference('user', '1');\n // check if the user is loaded\n let isLoaded = userRef.value() !== null;\n // get the record of the reference (null if not yet available)\n let user = userRef.value();\n // get the identifier of the reference\n if (userRef.remoteType() === 'id') {\n let id = userRef.id();\n }\n // load user (via store.find)\n userRef.load().then(...)\n // or trigger a reload\n userRef.reload().then(...)\n // provide data for reference\n userRef.push({ id: 1, username: '@user' }).then(function(user) {\n userRef.value() === user;\n });\n ```\n @method getReference\n @public\n @param {String|object} resource - modelName (string) or Identifier (object)\n @param {String|Integer} id\n @since 2.5.0\n @return {RecordReference}\n */\n // TODO @deprecate getReference (and references generally)\n getReference(resource, id) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'getReference');\n }\n let resourceIdentifier;\n if (arguments.length === 1 && isMaybeIdentifier(resource)) {\n resourceIdentifier = resource;\n } else {\n const type = normalizeModelName(resource);\n const normalizedId = ensureStringId(id);\n resourceIdentifier = constructResource(type, normalizedId);\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error('getReference expected to receive either a resource identifier or type and id as arguments');\n }\n })(isMaybeIdentifier(resourceIdentifier)) : {};\n const identifier = this.identifierCache.getOrCreateRecordIdentifier(resourceIdentifier);\n return this._instanceCache.getReference(identifier);\n }\n\n /**\n Get a record by a given type and ID without triggering a fetch.\n This method will synchronously return the record if it is available in the store,\n otherwise it will return `null`. A record is available if it has been fetched earlier, or\n pushed manually into the store.\n See [findRecord](../methods/findRecord?anchor=findRecord) if you would like to request this record from the backend.\n _Note: This is a synchronous method and does not return a promise._\n **Example 1**\n ```js\n let post = store.peekRecord('post', '1');\n post.id; // '1'\n ```\n `peekRecord` can be called with a single identifier argument instead of the combination\n of `type` (modelName) and `id` as separate arguments. You may recognize this combo as\n the typical pairing from [JSON:API](https://jsonapi.org/format/#document-resource-object-identification)\n **Example 2**\n ```js\n let post = store.peekRecord({ type: 'post', id });\n post.id; // '1'\n ```\n If you have previously received an lid from an Identifier for this record, you can lookup the record again using\n just the lid.\n **Example 3**\n ```js\n let post = store.peekRecord({ lid });\n post.id; // '1'\n ```\n @since 1.13.0\n @method peekRecord\n @public\n @param {String|object} modelName - either a string representing the modelName or a ResourceIdentifier object containing both the type (a string) and the id (a string) for the record or an lid (a string) of an existing record\n @param {String|Integer} id - optional only if the first param is a ResourceIdentifier, else the string id of the record to be retrieved.\n @return {Model|null} record\n */\n\n peekRecord(identifier, id) {\n if (arguments.length === 1 && isMaybeIdentifier(identifier)) {\n const stableIdentifier = this.identifierCache.peekRecordIdentifier(identifier);\n const isLoaded = stableIdentifier && this._instanceCache.recordIsLoaded(stableIdentifier);\n // TODO come up with a better mechanism for determining if we have data and could peek.\n // this is basically an \"are we not empty\" query.\n return isLoaded ? this._instanceCache.getRecord(stableIdentifier) : null;\n }\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'peekRecord');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a model name to the store's peekRecord method`);\n }\n })(identifier) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Passing classes to store methods has been removed. Please pass a dasherized string instead of ${String(identifier)}`);\n }\n })(typeof identifier === 'string') : {};\n const type = normalizeModelName(identifier);\n const normalizedId = ensureStringId(id);\n const resource = {\n type,\n id: normalizedId\n };\n const stableIdentifier = this.identifierCache.peekRecordIdentifier(resource);\n const isLoaded = stableIdentifier && this._instanceCache.recordIsLoaded(stableIdentifier);\n return isLoaded ? this._instanceCache.getRecord(stableIdentifier) : null;\n }\n\n /**\n This method delegates a query to the adapter. This is the one place where\n adapter-level semantics are exposed to the application.\n Each time this method is called a new request is made through the adapter.\n Exposing queries this way seems preferable to creating an abstract query\n language for all server-side queries, and then require all adapters to\n implement them.\n ---\n If you do something like this:\n ```javascript\n store.query('person', { page: 1 });\n ```\n The request made to the server will look something like this:\n ```\n GET \"/api/v1/person?page=1\"\n ```\n ---\n If you do something like this:\n ```javascript\n store.query('person', { ids: ['1', '2', '3'] });\n ```\n The request made to the server will look something like this:\n ```\n GET \"/api/v1/person?ids%5B%5D=1&ids%5B%5D=2&ids%5B%5D=3\"\n decoded: \"/api/v1/person?ids[]=1&ids[]=2&ids[]=3\"\n ```\n This method returns a promise, which is resolved with a\n [`Collection`](/ember-data/release/classes/Collection)\n once the server returns.\n @since 1.13.0\n @method query\n @public\n @param {String} type the name of the resource\n @param {object} query a query to be used by the adapter\n @param {Object} options optional, may include `adapterOptions` hash which will be passed to adapter.query\n @return {Promise} promise\n */\n\n query(type, query, options = {}) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'query');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a model name to the store's query method`);\n }\n })(type) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a query hash to the store's query method`);\n }\n })(query) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Passing classes to store methods has been removed. Please pass a dasherized string instead of ${type}`);\n }\n })(typeof type === 'string') : {};\n const promise = this.request({\n op: 'query',\n data: {\n type: normalizeModelName(type),\n query,\n options: options\n },\n cacheOptions: {\n [SkipCache]: true\n }\n });\n return promise.then(document => document.content);\n }\n\n /**\n This method makes a request for one record, where the `id` is not known\n beforehand (if the `id` is known, use [`findRecord`](../methods/findRecord?anchor=findRecord)\n instead).\n This method can be used when it is certain that the server will return a\n single object for the primary data.\n Each time this method is called a new request is made through the adapter.\n Let's assume our API provides an endpoint for the currently logged in user\n via:\n ```\n // GET /api/current_user\n {\n user: {\n id: 1234,\n username: 'admin'\n }\n }\n ```\n Since the specific `id` of the `user` is not known beforehand, we can use\n `queryRecord` to get the user:\n ```javascript\n store.queryRecord('user', {}).then(function(user) {\n let username = user.username;\n // do thing\n });\n ```\n The request is made through the adapters' `queryRecord`:\n ```app/adapters/user.js\n import Adapter from '@ember-data/adapter';\n import $ from 'jquery';\n export default class UserAdapter extends Adapter {\n queryRecord(modelName, query) {\n return $.getJSON('/api/current_user');\n }\n }\n ```\n Note: the primary use case for `store.queryRecord` is when a single record\n is queried and the `id` is not known beforehand. In all other cases\n `store.query` and using the first item of the array is likely the preferred\n way:\n ```\n // GET /users?username=unique\n {\n data: [{\n id: 1234,\n type: 'user',\n attributes: {\n username: \"unique\"\n }\n }]\n }\n ```\n ```javascript\n store.query('user', { username: 'unique' }).then(function(users) {\n return users.firstObject;\n }).then(function(user) {\n let id = user.id;\n });\n ```\n This method returns a promise, which resolves with the found record.\n If the adapter returns no data for the primary data of the payload, then\n `queryRecord` resolves with `null`:\n ```\n // GET /users?username=unique\n {\n data: null\n }\n ```\n ```javascript\n store.queryRecord('user', { username: 'unique' }).then(function(user) {\n // user is null\n });\n ```\n @since 1.13.0\n @method queryRecord\n @public\n @param {string} type\n @param {object} query an opaque query to be used by the adapter\n @param {object} options optional, may include `adapterOptions` hash which will be passed to adapter.queryRecord\n @return {Promise} promise which resolves with the found record or `null`\n */\n\n queryRecord(type, query, options) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'queryRecord');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a model name to the store's queryRecord method`);\n }\n })(type) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a query hash to the store's queryRecord method`);\n }\n })(query) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Passing classes to store methods has been removed. Please pass a dasherized string instead of ${type}`);\n }\n })(typeof type === 'string') : {};\n const promise = this.request({\n op: 'queryRecord',\n data: {\n type: normalizeModelName(type),\n query,\n options: options || {}\n },\n cacheOptions: {\n [SkipCache]: true\n }\n });\n return promise.then(document => document.content);\n }\n\n /**\n `findAll` asks the adapter's `findAll` method to find the records for the\n given type, and returns a promise which will resolve with all records of\n this type present in the store, even if the adapter only returns a subset\n of them.\n ```app/routes/authors.js\n export default class AuthorsRoute extends Route {\n model(params) {\n return this.store.findAll('author');\n }\n }\n ```\n _When_ the returned promise resolves depends on the reload behavior,\n configured via the passed `options` hash and the result of the adapter's\n `shouldReloadAll` method.\n ### Reloading\n If `{ reload: true }` is passed or `adapter.shouldReloadAll` evaluates to\n `true`, then the returned promise resolves once the adapter returns data,\n regardless if there are already records in the store:\n ```js\n store.push({\n data: {\n id: 'first',\n type: 'author'\n }\n });\n // adapter#findAll resolves with\n // [\n // {\n // id: 'second',\n // type: 'author'\n // }\n // ]\n store.findAll('author', { reload: true }).then(function(authors) {\n authors.getEach('id'); // ['first', 'second']\n });\n ```\n If no reload is indicated via the above mentioned ways, then the promise\n immediately resolves with all the records currently loaded in the store.\n ### Background Reloading\n Optionally, if `adapter.shouldBackgroundReloadAll` evaluates to `true`,\n then a background reload is started. Once this resolves, the array with\n which the promise resolves, is updated automatically so it contains all the\n records in the store:\n ```app/adapters/application.js\n import Adapter from '@ember-data/adapter';\n export default class ApplicationAdapter extends Adapter {\n shouldReloadAll(store, snapshotsArray) {\n return false;\n },\n shouldBackgroundReloadAll(store, snapshotsArray) {\n return true;\n }\n });\n // ...\n store.push({\n data: {\n id: 'first',\n type: 'author'\n }\n });\n let allAuthors;\n store.findAll('author').then(function(authors) {\n authors.getEach('id'); // ['first']\n allAuthors = authors;\n });\n // later, once adapter#findAll resolved with\n // [\n // {\n // id: 'second',\n // type: 'author'\n // }\n // ]\n allAuthors.getEach('id'); // ['first', 'second']\n ```\n If you would like to force or prevent background reloading, you can set a\n boolean value for `backgroundReload` in the options object for\n `findAll`.\n ```app/routes/post/edit.js\n export default class PostEditRoute extends Route {\n model() {\n return this.store.findAll('post', { backgroundReload: false });\n }\n }\n ```\n If you pass an object on the `adapterOptions` property of the options\n argument it will be passed to you adapter via the `snapshotRecordArray`\n ```app/routes/posts.js\n export default class PostsRoute extends Route {\n model(params) {\n return this.store.findAll('post', {\n adapterOptions: { subscribe: false }\n });\n }\n }\n ```\n ```app/adapters/post.js\n import MyCustomAdapter from './custom-adapter';\n export default class UserAdapter extends MyCustomAdapter {\n findAll(store, type, sinceToken, snapshotRecordArray) {\n if (snapshotRecordArray.adapterOptions.subscribe) {\n // ...\n }\n // ...\n }\n }\n ```\n See [peekAll](../methods/peekAll?anchor=peekAll) to get an array of current records in the\n store, without waiting until a reload is finished.\n ### Retrieving Related Model Records\n If you use an adapter such as Ember's default\n [`JSONAPIAdapter`](/ember-data/release/classes/JSONAPIAdapter)\n that supports the [JSON API specification](http://jsonapi.org/) and if your server\n endpoint supports the use of an\n ['include' query parameter](http://jsonapi.org/format/#fetching-includes),\n you can use `findAll()` to automatically retrieve additional records related to\n those requested by supplying an `include` parameter in the `options` object.\n For example, given a `post` model that has a `hasMany` relationship with a `comment`\n model, when we retrieve all of the post records we can have the server also return\n all of the posts' comments in the same request:\n ```app/routes/posts.js\n export default class PostsRoute extends Route {\n model() {\n return this.store.findAll('post', { include: 'comments' });\n }\n }\n ```\n Multiple relationships can be requested using an `include` parameter consisting of a\n comma-separated list (without white-space) while nested relationships can be specified\n using a dot-separated sequence of relationship names. So to request both the posts'\n comments and the authors of those comments the request would look like this:\n ```app/routes/posts.js\n export default class PostsRoute extends Route {\n model() {\n return this.store.findAll('post', { include: 'comments,comments.author' });\n }\n }\n ```\n See [query](../methods/query?anchor=query) to only get a subset of records from the server.\n @since 1.13.0\n @method findAll\n @public\n @param {string} type the name of the resource\n @param {object} options\n @return {Promise} promise\n */\n\n findAll(type, options = {}) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'findAll');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a model name to the store's findAll method`);\n }\n })(type) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Passing classes to store methods has been removed. Please pass a dasherized string instead of ${type}`);\n }\n })(typeof type === 'string') : {};\n const promise = this.request({\n op: 'findAll',\n data: {\n type: normalizeModelName(type),\n options: options || {}\n },\n cacheOptions: {\n [SkipCache]: true\n }\n });\n return promise.then(document => document.content);\n }\n\n /**\n This method returns a filtered array that contains all of the\n known records for a given type in the store.\n Note that because it's just a filter, the result will contain any\n locally created records of the type, however, it will not make a\n request to the backend to retrieve additional records. If you\n would like to request all the records from the backend please use\n [store.findAll](../methods/findAll?anchor=findAll).\n Also note that multiple calls to `peekAll` for a given type will always\n return the same `RecordArray`.\n Example\n ```javascript\n let localPosts = store.peekAll('post');\n ```\n @since 1.13.0\n @method peekAll\n @public\n @param {string} type the name of the resource\n @return {RecordArray}\n */\n\n peekAll(type) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'peekAll');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You need to pass a model name to the store's peekAll method`);\n }\n })(type) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Passing classes to store methods has been removed. Please pass a dasherized string instead of ${type}`);\n }\n })(typeof type === 'string') : {};\n return this.recordArrayManager.liveArrayFor(normalizeModelName(type));\n }\n\n /**\n This method unloads all records in the store.\n It schedules unloading to happen during the next run loop.\n Optionally you can pass a type which unload all records for a given type.\n ```javascript\n store.unloadAll();\n store.unloadAll('post');\n ```\n @method unloadAll\n @param {string} type the name of the resource\n @public\n */\n\n unloadAll(type) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyedStoreOnly(this, 'unloadAll');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Passing classes to store methods has been removed. Please pass a dasherized string instead of ${String(type)}`);\n }\n })(!type || typeof type === 'string') : {};\n this._join(() => {\n if (type === undefined) {\n // destroy the graph before unloadAll\n // since then we avoid churning relationships\n // during unload\n this._graph?.identifiers.clear();\n this.recordArrayManager.clear();\n this._instanceCache.clear();\n } else {\n this._instanceCache.clear(normalizeModelName(type));\n }\n });\n }\n\n /**\n Push some data for a given type into the store.\n This method expects normalized [JSON API](http://jsonapi.org/) document. This means you have to follow [JSON API specification](http://jsonapi.org/format/) with few minor adjustments:\n - record's `type` should always be in singular, dasherized form\n - members (properties) should be camelCased\n [Your primary data should be wrapped inside `data` property](http://jsonapi.org/format/#document-top-level):\n ```js\n store.push({\n data: {\n // primary data for single record of type `Person`\n id: '1',\n type: 'person',\n attributes: {\n firstName: 'Daniel',\n lastName: 'Kmak'\n }\n }\n });\n ```\n [Demo.](http://ember-twiddle.com/fb99f18cd3b4d3e2a4c7)\n `data` property can also hold an array (of records):\n ```js\n store.push({\n data: [\n // an array of records\n {\n id: '1',\n type: 'person',\n attributes: {\n firstName: 'Daniel',\n lastName: 'Kmak'\n }\n },\n {\n id: '2',\n type: 'person',\n attributes: {\n firstName: 'Tom',\n lastName: 'Dale'\n }\n }\n ]\n });\n ```\n [Demo.](http://ember-twiddle.com/69cdbeaa3702159dc355)\n There are some typical properties for `JSONAPI` payload:\n * `id` - mandatory, unique record's key\n * `type` - mandatory string which matches `model`'s dasherized name in singular form\n * `attributes` - object which holds data for record attributes - `attr`'s declared in model\n * `relationships` - object which must contain any of the following properties under each relationships' respective key (example path is `relationships.achievements.data`):\n - [`links`](http://jsonapi.org/format/#document-links)\n - [`data`](http://jsonapi.org/format/#document-resource-object-linkage) - place for primary data\n - [`meta`](http://jsonapi.org/format/#document-meta) - object which contains meta-information about relationship\n For this model:\n ```app/models/person.js\n import Model, { attr, hasMany } from '@ember-data/model';\n export default class PersonRoute extends Route {\n @attr('string') firstName;\n @attr('string') lastName;\n @hasMany('person') children;\n }\n ```\n To represent the children as IDs:\n ```js\n {\n data: {\n id: '1',\n type: 'person',\n attributes: {\n firstName: 'Tom',\n lastName: 'Dale'\n },\n relationships: {\n children: {\n data: [\n {\n id: '2',\n type: 'person'\n },\n {\n id: '3',\n type: 'person'\n },\n {\n id: '4',\n type: 'person'\n }\n ]\n }\n }\n }\n }\n ```\n [Demo.](http://ember-twiddle.com/343e1735e034091f5bde)\n To represent the children relationship as a URL:\n ```js\n {\n data: {\n id: '1',\n type: 'person',\n attributes: {\n firstName: 'Tom',\n lastName: 'Dale'\n },\n relationships: {\n children: {\n links: {\n related: '/people/1/children'\n }\n }\n }\n }\n }\n ```\n If you're streaming data or implementing an adapter, make sure\n that you have converted the incoming data into this form. The\n store's [normalize](../methods/normalize?anchor=normalize) method is a convenience\n helper for converting a json payload into the form Ember Data\n expects.\n ```js\n store.push(store.normalize('person', data));\n ```\n This method can be used both to push in brand new\n records, as well as to update existing records.\n @method push\n @public\n @param {Object} data\n @return the record(s) that was created or\n updated.\n */\n\n push(data) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'push');\n }\n const pushed = this._push(data, false);\n if (Array.isArray(pushed)) {\n return pushed.map(identifier => this._instanceCache.getRecord(identifier));\n }\n if (pushed === null) {\n return null;\n }\n return this._instanceCache.getRecord(pushed);\n }\n\n /**\n Push some data in the form of a json-api document into the store,\n without creating materialized records.\n @method _push\n @private\n @param {Object} jsonApiDoc\n @return {StableRecordIdentifier|Array|null} identifiers for the primary records that had data loaded\n */\n _push(jsonApiDoc, asyncFlush) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, '_push');\n }\n if (macroCondition(getGlobalConfig().WarpDrive.debug.LOG_PAYLOADS)) {\n try {\n const data = JSON.parse(JSON.stringify(jsonApiDoc));\n // eslint-disable-next-line no-console\n console.log('EmberData | Payload - push', data);\n } catch (e) {\n // eslint-disable-next-line no-console\n console.log('EmberData | Payload - push', jsonApiDoc);\n }\n }\n if (asyncFlush) {\n this._enableAsyncFlush = true;\n }\n let ret;\n this._join(() => {\n ret = this.cache.put({\n content: jsonApiDoc\n });\n });\n this._enableAsyncFlush = null;\n return 'data' in ret ? ret.data : null;\n }\n\n /**\n * Trigger a save for a Record.\n *\n * Returns a promise resolving with the same record when the save is complete.\n *\n * @method saveRecord\n * @public\n * @param {unknown} record\n * @param options\n * @return {Promise}\n */\n saveRecord(record, options = {}) {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertDestroyingStore(this, 'saveRecord');\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Unable to initiate save for a record in a disconnected state`);\n }\n })(storeFor(record)) : {};\n const identifier = recordIdentifierFor(record);\n const cache = this.cache;\n if (!identifier) {\n // this commonly means we're disconnected\n // but just in case we reject here to prevent bad things.\n return Promise.reject(new Error(`Record Is Disconnected`));\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Cannot initiate a save request for an unloaded record: ${identifier.lid}`);\n }\n })(this._instanceCache.recordIsLoaded(identifier)) : {};\n if (resourceIsFullyDeleted(this._instanceCache, identifier)) {\n return Promise.resolve(record);\n }\n if (!options) {\n options = {};\n }\n let operation = 'updateRecord';\n if (cache.isNew(identifier)) {\n operation = 'createRecord';\n } else if (cache.isDeleted(identifier)) {\n operation = 'deleteRecord';\n }\n const request = {\n op: operation,\n data: {\n options,\n record: identifier\n },\n records: [identifier],\n cacheOptions: {\n [SkipCache]: true\n }\n };\n return this.request(request).then(document => document.content);\n }\n\n /**\n * Instantiation hook allowing applications or addons to configure the store\n * to utilize a custom Cache implementation.\n *\n * This hook should not be called directly by consuming applications or libraries.\n * Use `Store.cache` to access the Cache instance.\n *\n * @method createCache (hook)\n * @public\n * @param storeWrapper\n * @return {Cache}\n */\n\n /**\n * Returns the cache instance associated to this Store, instantiates the Cache\n * if necessary via `Store.createCache`\n *\n * @property {Cache} cache\n * @public\n */\n get cache() {\n let {\n cache\n } = this._instanceCache;\n if (!cache) {\n cache = this._instanceCache.cache = this.createCache(this._instanceCache._storeWrapper);\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n cache = new CacheManager(cache);\n }\n }\n return cache;\n }\n destroy() {\n if (this.isDestroyed) {\n // @ember/test-helpers will call destroy multiple times\n return;\n }\n this.isDestroying = true;\n this._graph?.destroy();\n this._graph = undefined;\n this.notifications.destroy();\n this.recordArrayManager.destroy();\n this.identifierCache.destroy();\n this.unloadAll();\n this.isDestroyed = true;\n }\n static create(args) {\n return new this(args);\n }\n}\nif (macroCondition(getGlobalConfig().WarpDrive.deprecations.ENABLE_LEGACY_SCHEMA_SERVICE)) {\n Store.prototype.getSchemaDefinitionService = function () {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You must registerSchemaDefinitionService with the store to use custom model classes`);\n }\n })(this._schema) : {};\n deprecate(`Use \\`store.schema\\` instead of \\`store.getSchemaDefinitionService()\\``, false, {\n id: 'ember-data:schema-service-updates',\n until: '5.0',\n for: 'ember-data',\n since: {\n available: '5.4',\n enabled: '5.4'\n }\n });\n return this._schema;\n };\n Store.prototype.registerSchemaDefinitionService = function (schema) {\n deprecate(`Use \\`store.createSchemaService\\` instead of \\`store.registerSchemaDefinitionService()\\``, false, {\n id: 'ember-data:schema-service-updates',\n until: '5.0',\n for: 'ember-data',\n since: {\n available: '5.4',\n enabled: '5.4'\n }\n });\n this._schema = schema;\n };\n Store.prototype.registerSchema = function (schema) {\n deprecate(`Use \\`store.createSchemaService\\` instead of \\`store.registerSchema()\\``, false, {\n id: 'ember-data:schema-service-updates',\n until: '5.0',\n for: 'ember-data',\n since: {\n available: '5.4',\n enabled: '5.4'\n }\n });\n this._schema = schema;\n };\n}\nlet assertDestroyingStore;\nlet assertDestroyedStoreOnly;\nif (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n // eslint-disable-next-line @typescript-eslint/no-shadow\n assertDestroyingStore = function assertDestroyingStore(store, method) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Attempted to call store.${method}(), but the store instance has already been destroyed.`);\n }\n })(!(store.isDestroying || store.isDestroyed)) : {};\n };\n // eslint-disable-next-line @typescript-eslint/no-shadow\n assertDestroyedStoreOnly = function assertDestroyedStoreOnly(store, method) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`Attempted to call store.${method}(), but the store instance has already been destroyed.`);\n }\n })(!store.isDestroyed) : {};\n };\n}\nfunction isMaybeIdentifier(maybeIdentifier) {\n return Boolean(maybeIdentifier !== null && typeof maybeIdentifier === 'object' && ('id' in maybeIdentifier && 'type' in maybeIdentifier && maybeIdentifier.id && maybeIdentifier.type || maybeIdentifier.lid));\n}\nfunction normalizeProperties(store, identifier, properties) {\n // assert here\n if (properties !== undefined) {\n if ('id' in properties) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`expected id to be a string or null`);\n }\n })(properties.id !== undefined) : {};\n }\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You passed '${typeof properties}' as properties for record creation instead of an object.`);\n }\n })(typeof properties === 'object' && properties !== null) : {};\n const {\n type\n } = identifier;\n\n // convert relationship Records to RecordDatas before passing to RecordData\n const defs = store.schema.fields({\n type\n });\n if (defs.size) {\n const keys = Object.keys(properties);\n for (let i = 0; i < keys.length; i++) {\n const prop = keys[i];\n const field = defs.get(prop);\n if (!field) continue;\n if (field.kind === 'hasMany') {\n if (macroCondition(getGlobalConfig().WarpDrive.env.DEBUG)) {\n assertRecordsPassedToHasMany(properties[prop]);\n }\n properties[prop] = extractIdentifiersFromRecords(properties[prop]);\n } else if (field.kind === 'belongsTo') {\n properties[prop] = extractIdentifierFromRecord(properties[prop]);\n }\n }\n }\n }\n return properties;\n}\nfunction assertRecordsPassedToHasMany(records) {\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`You must pass an array of records to set a hasMany relationship`);\n }\n })(Array.isArray(records)) : {};\n macroCondition(getGlobalConfig().WarpDrive.env.DEBUG) ? (test => {\n if (!test) {\n throw new Error(`All elements of a hasMany relationship must be instances of Model, you passed ${records.map(r => `${typeof r}`).join(', ')}`);\n }\n })(function () {\n return records.every(record => {\n try {\n recordIdentifierFor(record);\n return true;\n } catch {\n return false;\n }\n });\n }()) : {};\n}\nfunction extractIdentifiersFromRecords(records) {\n return records.map(record => extractIdentifierFromRecord(record));\n}\nfunction extractIdentifierFromRecord(recordOrPromiseRecord) {\n if (!recordOrPromiseRecord) {\n return null;\n }\n const extract = recordIdentifierFor;\n return extract(recordOrPromiseRecord);\n}\n\n/**\n * @module @ember-data/store\n */\nfunction urlFromLink(link) {\n if (typeof link === 'string') return link;\n return link.href;\n}\n\n/**\n * A Document is a class that wraps the response content from a request to the API\n * returned by `Cache.put` or `Cache.peek`, converting resource-identifiers into\n * record instances.\n *\n * It is not directly instantiated by the user, and its properties should not\n * be directly modified. Whether individual properties are mutable or not is\n * determined by the record instance itself.\n *\n * @public\n * @class Document\n */\nclass Document {\n /**\n * The links object for this document, if any\n *\n * e.g.\n *\n * ```\n * {\n * self: '/articles?page[number]=3',\n * }\n * ```\n *\n * @property links\n * @type {object|undefined} - a links object\n * @public\n */\n\n /**\n * The primary data for this document, if any.\n *\n * If this document has no primary data (e.g. because it is an error document)\n * this property will be `undefined`.\n *\n * For collections this will be an array of record instances,\n * for single resource requests it will be a single record instance or null.\n *\n * @property data\n * @public\n * @type {object|Array
![\\\"Une](\\\"/assets/ui-images/illustration-cgu.svg\\\")
\\n\\n {{#if this.shouldShowOncoToulouseSection}}\\n