@hellpig/anarchy-engine 21.4.1 → 22.0.1

package/legal/THIRD_PARTY_LICENSES.md

@@ -2,7 +2,7 @@
 
 ## Application: @hellpig/anarchy-engine
 
-Production dependencies (including transition dependencies): 15
+Production dependencies (including transition dependencies): 14
 
 ---
 
@@ -20,219 +20,7 @@ _No license text file found; relying on package metadata._
 
 ---
 
-## @dimforge/rapier3d@0.19.3
-
-**License:** Apache-2.0
-
-**Repository:** https://github.com/dimforge/rapier.js
-
-**URL:** https://rapier.rs
-
-Apache License
-Version 2.0, January 2004
-http://www.apache.org/licenses/
-
-TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-1.  Definitions.
-
-    "License" shall mean the terms and conditions for use, reproduction,
-    and distribution as defined by Sections 1 through 9 of this document.
-
-    "Licensor" shall mean the copyright owner or entity authorized by
-    the copyright owner that is granting the License.
-
-    "Legal Entity" shall mean the union of the acting entity and all
-    other entities that control, are controlled by, or are under common
-    control with that entity. For the purposes of this definition,
-    "control" means (i) the power, direct or indirect, to cause the
-    direction or management of such entity, whether by contract or
-    otherwise, or (ii) ownership of fifty percent (50%) or more of the
-    outstanding shares, or (iii) beneficial ownership of such entity.
-
-    "You" (or "Your") shall mean an individual or Legal Entity
-    exercising permissions granted by this License.
-
-    "Source" form shall mean the preferred form for making modifications,
-    including but not limited to software source code, documentation
-    source, and configuration files.
-
-    "Object" form shall mean any form resulting from mechanical
-    transformation or translation of a Source form, including but
-    not limited to compiled object code, generated documentation,
-    and conversions to other media types.
-
-    "Work" shall mean the work of authorship, whether in Source or
-    Object form, made available under the License, as indicated by a
-    copyright notice that is included in or attached to the work
-    (an example is provided in the Appendix below).
-
-    "Derivative Works" shall mean any work, whether in Source or Object
-    form, that is based on (or derived from) the Work and for which the
-    editorial revisions, annotations, elaborations, or other modifications
-    represent, as a whole, an original work of authorship. For the purposes
-    of this License, Derivative Works shall not include works that remain
-    separable from, or merely link (or bind by name) to the interfaces of,
-    the Work and Derivative Works thereof.
-
-    "Contribution" shall mean any work of authorship, including
-    the original version of the Work and any modifications or additions
-    to that Work or Derivative Works thereof, that is intentionally
-    submitted to Licensor for inclusion in the Work by the copyright owner
-    or by an individual or Legal Entity authorized to submit on behalf of
-    the copyright owner. For the purposes of this definition, "submitted"
-    means any form of electronic, verbal, or written communication sent
-    to the Licensor or its representatives, including but not limited to
-    communication on electronic mailing lists, source code control systems,
-    and issue tracking systems that are managed by, or on behalf of, the
-    Licensor for the purpose of discussing and improving the Work, but
-    excluding communication that is conspicuously marked or otherwise
-    designated in writing by the copyright owner as "Not a Contribution."
-
-    "Contributor" shall mean Licensor and any individual or Legal Entity
-    on behalf of whom a Contribution has been received by Licensor and
-    subsequently incorporated within the Work.
-
-2.  Grant of Copyright License. Subject to the terms and conditions of
-    this License, each Contributor hereby grants to You a perpetual,
-    worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-    copyright license to reproduce, prepare Derivative Works of,
-    publicly display, publicly perform, sublicense, and distribute the
-    Work and such Derivative Works in Source or Object form.
-
-3.  Grant of Patent License. Subject to the terms and conditions of
-    this License, each Contributor hereby grants to You a perpetual,
-    worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-    (except as stated in this section) patent license to make, have made,
-    use, offer to sell, sell, import, and otherwise transfer the Work,
-    where such license applies only to those patent claims licensable
-    by such Contributor that are necessarily infringed by their
-    Contribution(s) alone or by combination of their Contribution(s)
-    with the Work to which such Contribution(s) was submitted. If You
-    institute patent litigation against any entity (including a
-    cross-claim or counterclaim in a lawsuit) alleging that the Work
-    or a Contribution incorporated within the Work constitutes direct
-    or contributory patent infringement, then any patent licenses
-    granted to You under this License for that Work shall terminate
-    as of the date such litigation is filed.
-
-4.  Redistribution. You may reproduce and distribute copies of the
-    Work or Derivative Works thereof in any medium, with or without
-    modifications, and in Source or Object form, provided that You
-    meet the following conditions:
-
-    (a) You must give any other recipients of the Work or
-    Derivative Works a copy of this License; and
-
-    (b) You must cause any modified files to carry prominent notices
-    stating that You changed the files; and
-
-    (c) You must retain, in the Source form of any Derivative Works
-    that You distribute, all copyright, patent, trademark, and
-    attribution notices from the Source form of the Work,
-    excluding those notices that do not pertain to any part of
-    the Derivative Works; and
-
-    (d) If the Work includes a "NOTICE" text file as part of its
-    distribution, then any Derivative Works that You distribute must
-    include a readable copy of the attribution notices contained
-    within such NOTICE file, excluding those notices that do not
-    pertain to any part of the Derivative Works, in at least one
-    of the following places: within a NOTICE text file distributed
-    as part of the Derivative Works; within the Source form or
-    documentation, if provided along with the Derivative Works; or,
-    within a display generated by the Derivative Works, if and
-    wherever such third-party notices normally appear. The contents
-    of the NOTICE file are for informational purposes only and
-    do not modify the License. You may add Your own attribution
-    notices within Derivative Works that You distribute, alongside
-    or as an addendum to the NOTICE text from the Work, provided
-    that such additional attribution notices cannot be construed
-    as modifying the License.
-
-    You may add Your own copyright statement to Your modifications and
-    may provide additional or different license terms and conditions
-    for use, reproduction, or distribution of Your modifications, or
-    for any such Derivative Works as a whole, provided Your use,
-    reproduction, and distribution of the Work otherwise complies with
-    the conditions stated in this License.
-
-5.  Submission of Contributions. Unless You explicitly state otherwise,
-    any Contribution intentionally submitted for inclusion in the Work
-    by You to the Licensor shall be under the terms and conditions of
-    this License, without any additional terms or conditions.
-    Notwithstanding the above, nothing herein shall supersede or modify
-    the terms of any separate license agreement you may have executed
-    with Licensor regarding such Contributions.
-
-6.  Trademarks. This License does not grant permission to use the trade
-    names, trademarks, service marks, or product names of the Licensor,
-    except as required for reasonable and customary use in describing the
-    origin of the Work and reproducing the content of the NOTICE file.
-
-7.  Disclaimer of Warranty. Unless required by applicable law or
-    agreed to in writing, Licensor provides the Work (and each
-    Contributor provides its Contributions) on an "AS IS" BASIS,
-    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-    implied, including, without limitation, any warranties or conditions
-    of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-    PARTICULAR PURPOSE. You are solely responsible for determining the
-    appropriateness of using or redistributing the Work and assume any
-    risks associated with Your exercise of permissions under this License.
-
-8.  Limitation of Liability. In no event and under no legal theory,
-    whether in tort (including negligence), contract, or otherwise,
-    unless required by applicable law (such as deliberate and grossly
-    negligent acts) or agreed to in writing, shall any Contributor be
-    liable to You for damages, including any direct, indirect, special,
-    incidental, or consequential damages of any character arising as a
-    result of this License or out of the use or inability to use the
-    Work (including but not limited to damages for loss of goodwill,
-    work stoppage, computer failure or malfunction, or any and all
-    other commercial damages or losses), even if such Contributor
-    has been advised of the possibility of such damages.
-
-9.  Accepting Warranty or Additional Liability. While redistributing
-    the Work or Derivative Works thereof, You may choose to offer,
-    and charge a fee for, acceptance of support, warranty, indemnity,
-    or other liability obligations and/or rights consistent with this
-    License. However, in accepting such obligations, You may act only
-    on Your own behalf and on Your sole responsibility, not on behalf
-    of any other Contributor, and only if You agree to indemnify,
-    defend, and hold each Contributor harmless for any liability
-    incurred by, or claims asserted against, such Contributor by reason
-    of your accepting any such warranty or additional liability.
-
-END OF TERMS AND CONDITIONS
-
-APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-Copyright 2020 Dimforge EURL
-
-Licensed under the Apache License, Version 2.0 (the "License");
-you may not use this file except in compliance with the License.
-You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-Unless required by applicable law or agreed to in writing, software
-distributed under the License is distributed on an "AS IS" BASIS,
-WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-See the License for the specific language governing permissions and
-limitations under the License.
-
----
-
-## @hellpig/anarchy-shared@1.6.1
+## @hellpig/anarchy-shared@1.6.2
 
 **License:** MIT
 

package/package.json

@@ -2,7 +2,7 @@
   "name": "@hellpig/anarchy-engine",
   "author": "S. Panfilov",
   "private": false,
-  "version": "21.4.1",
+  "version": "22.0.1",
   "type": "module",
   "repository": {
     "type": "git",
@@ -81,19 +81,30 @@
   },
   "dependencies": {
     "@cfworker/json-schema": "4.1.1",
-    "@dimforge/rapier3d": "0.19.3",
     "@hellpig/anarchy-shared": "*",
     "date-fns": "4.1.0",
     "lodash-es": "4.17.22",
     "nanoid": "5.1.6",
     "rbush": "4.0.1",
     "rxjs": "7.8.2",
-    "three": "0.182.0",
     "three-mesh-bvh": "0.9.4",
     "ts-key-enum": "3.0.13",
     "typescript-fsm": "1.6.0"
   },
+  "peerDependencies": {
+    "@dimforge/rapier3d": "^0.19.3",
+    "three": "^0.182.0"
+  },
+  "peerDependenciesMeta": {
+    "@dimforge/rapier3d": {
+      "optional": false
+    },
+    "three": {
+      "optional": false
+    }
+  },
   "devDependencies": {
+    "@dimforge/rapier3d": "0.19.3",
     "@dimforge/rapier3d-compat": "0.19.3",
     "@gltf-transform/cli": "4.2.1",
     "@types/lodash-es": "4.17.12",
@@ -103,6 +114,7 @@
     "rollup-plugin-esbuild-minify": "1.3.0",
     "rollup-plugin-terser": "7.0.2",
     "source-map-explorer": "2.5.3",
+    "three": "0.182.0",
     "ts-morph": "27.0.2"
   }
 }

package/dist/Audio/Adapters/ConfigToParams.d.ts

@@ -1,2 +0,0 @@
-import { TAnyAudioConfig, TAnyAudioParams, TAudioConfigToParamsDependencies } from '../Models';
-export declare function configToParams(config: TAnyAudioConfig, { audioResourceAsyncRegistry, audioListenersRegistry }: TAudioConfigToParamsDependencies): TAnyAudioParams;

package/dist/Audio/Adapters/ConfigToParams.js

@@ -1,2 +0,0 @@
-import"../../home/runner/work/anarchy-engine/anarchy-engine/node_modules/three/build/three.module.js";import{Listeners}from"../Constants/Listeners.js";import{isAudio3dConfig}from"../Utils/AudioUtils.js";import{Vector3}from"../../home/runner/work/anarchy-engine/anarchy-engine/node_modules/three/build/three.core.js";function configToParams(config,{audioResourceAsyncRegistry:audioResourceAsyncRegistry,audioListenersRegistry:audioListenersRegistry}){const{position:position,...rest}=config,result={...rest,listener:audioListenersRegistry.findByKey(config.listener??Listeners.Main),audioSource:getAudio(config,audioResourceAsyncRegistry)};return isAudio3dConfig(config)?(result.position=new Vector3(position.x,position.y),result):result}function getAudio(config,audioResourceAsyncRegistry){return audioResourceAsyncRegistry.getByKey(config.audioSource)}export{configToParams};
-//# sourceMappingURL=ConfigToParams.js.map

package/dist/Audio/Adapters/ConfigToParams.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ConfigToParams.js","sources":["../../../src/Audio/Adapters/ConfigToParams.ts"],"sourcesContent":["import { Listeners } from '@Anarchy/Engine/Audio/Constants';\nimport type { TAnyAudioConfig, TAnyAudioParams, TAudio3dConfig, TAudio3dParams, TAudioConfigToParamsDependencies, TAudioResourceAsyncRegistry } from '@Anarchy/Engine/Audio/Models';\nimport { isAudio3dConfig } from '@Anarchy/Engine/Audio/Utils';\nimport type { TWriteable } from '@Anarchy/Shared/Utils';\nimport { Vector3 } from 'three';\n\nexport function configToParams(config: TAnyAudioConfig, { audioResourceAsyncRegistry, audioListenersRegistry }: TAudioConfigToParamsDependencies): TAnyAudioParams {\n  const { position, ...rest } = config as TAudio3dConfig;\n\n  const result: TAnyAudioParams = {\n    ...rest,\n    listener: audioListenersRegistry.findByKey(config.listener ?? Listeners.Main),\n    audioSource: getAudio(config, audioResourceAsyncRegistry)\n  };\n\n  if (isAudio3dConfig(config)) {\n    // eslint-disable-next-line functional/immutable-data\n    (result as TWriteable<TAudio3dParams>).position = new Vector3(position.x, position.y);\n    return result;\n  }\n\n  return result;\n}\n\nfunction getAudio(config: TAnyAudioConfig, audioResourceAsyncRegistry: TAudioResourceAsyncRegistry): AudioBuffer {\n  return audioResourceAsyncRegistry.getByKey(config.audioSource);\n}\n"],"names":["configToParams","config","audioResourceAsyncRegistry","audioListenersRegistry","position","rest","result","listener","findByKey","Listeners","Main","audioSource","getAudio","isAudio3dConfig","Vector3","x","y","getByKey"],"mappings":"4TAMO,SAASA,eAAeC,QAAyBC,2BAAEA,2BAAAC,uBAA4BA,yBACpF,MAAMC,SAAEA,YAAaC,MAASJ,OAExBK,OAA0B,IAC3BD,KACHE,SAAUJ,uBAAuBK,UAAUP,OAAOM,UAAYE,UAAUC,MACxEC,YAAaC,SAASX,OAAQC,6BAGhC,OAAIW,gBAAgBZ,SAEjBK,OAAsCF,SAAW,IAAIU,QAAQV,SAASW,EAAGX,SAASY,GAC5EV,QAGFA,MACT,CAEA,SAASM,SAASX,OAAyBC,4BACzC,OAAOA,2BAA2Be,SAAShB,OAAOU,YACpD"}

package/dist/__vite-plugin-wasm-helper.js

@@ -1,2 +0,0 @@
-const __vite__initWasm=async(opts={},url)=>{let result;if(url.startsWith("data:")){const urlContent=url.replace(/^data:.*?base64,/,"");let bytes;if("function"==typeof Buffer&&"function"==typeof Buffer.from)bytes=Buffer.from(urlContent,"base64");else{if("function"!=typeof atob)throw new Error("Cannot decode base64-encoded data URL");{const binaryString=atob(urlContent);bytes=new Uint8Array(binaryString.length);for(let i=0;i<binaryString.length;i++)bytes[i]=binaryString.charCodeAt(i)}}result=await WebAssembly.instantiate(bytes,opts)}else{const response=await fetch(url),contentType=response.headers.get("Content-Type")||"";if("instantiateStreaming"in WebAssembly&&contentType.startsWith("application/wasm"))result=await WebAssembly.instantiateStreaming(response,opts);else{const buffer=await response.arrayBuffer();result=await WebAssembly.instantiate(buffer,opts)}}return result.instance.exports};export{__vite__initWasm as default};
-//# sourceMappingURL=__vite-plugin-wasm-helper.js.map

package/dist/__vite-plugin-wasm-helper.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"__vite-plugin-wasm-helper.js","sources":["../../../../../../../../__vite-plugin-wasm-helper"],"sourcesContent":["export default async (opts = {}, url) => {\n    let result;\n    if (url.startsWith(\"data:\")) {\n        const urlContent = url.replace(/^data:.*?base64,/, \"\");\n        let bytes;\n        if (typeof Buffer === \"function\" && typeof Buffer.from === \"function\") {\n            bytes = Buffer.from(urlContent, \"base64\");\n        }\n        else if (typeof atob === \"function\") {\n            const binaryString = atob(urlContent);\n            bytes = new Uint8Array(binaryString.length);\n            for (let i = 0; i < binaryString.length; i++) {\n                bytes[i] = binaryString.charCodeAt(i);\n            }\n        }\n        else {\n            throw new Error(\"Cannot decode base64-encoded data URL\");\n        }\n        result = await WebAssembly.instantiate(bytes, opts);\n    }\n    else {\n        // https://github.com/mdn/webassembly-examples/issues/5\n        // WebAssembly.instantiateStreaming requires the server to provide the\n        // correct MIME type for .wasm files, which unfortunately doesn't work for\n        // a lot of static file servers, so we just work around it by getting the\n        // raw buffer.\n        // @ts-ignore\n        const response = await fetch(url);\n        const contentType = response.headers.get(\"Content-Type\") || \"\";\n        if (\"instantiateStreaming\" in WebAssembly && contentType.startsWith(\"application/wasm\")) {\n            result = await WebAssembly.instantiateStreaming(response, opts);\n        }\n        else {\n            const buffer = await response.arrayBuffer();\n            result = await WebAssembly.instantiate(buffer, opts);\n        }\n    }\n    return result.instance.exports;\n}"],"names":["__vite__initWasm","async","opts","url","result","startsWith","urlContent","replace","bytes","Buffer","from","atob","Error","binaryString","Uint8Array","length","i","charCodeAt","WebAssembly","instantiate","response","fetch","contentType","headers","get","instantiateStreaming","buffer","arrayBuffer","instance","exports"],"mappings":"AAAA,MAAAA,iBAAeC,MAAOC,KAAO,CAAA,EAAIC,OAC7B,IAAIC,OACJ,GAAID,IAAIE,WAAW,SAAU,CACzB,MAAMC,WAAaH,IAAII,QAAQ,mBAAoB,IACnD,IAAIC,MACJ,GAAsB,mBAAXC,QAAgD,mBAAhBA,OAAOC,KAC9CF,MAAQC,OAAOC,KAAKJ,WAAY,cAE/B,IAAoB,mBAATK,KAQZ,MAAM,IAAIC,MAAM,yCARiB,CACjC,MAAMC,aAAeF,KAAKL,YAC1BE,MAAQ,IAAIM,WAAWD,aAAaE,QACpC,IAAK,IAAIC,EAAI,EAAGA,EAAIH,aAAaE,OAAQC,IACrCR,MAAMQ,GAAKH,aAAaI,WAAWD,EAE3C,CAGA,CACAZ,aAAec,YAAYC,YAAYX,MAAON,KAClD,KACK,CAOD,MAAMkB,eAAiBC,MAAMlB,KACvBmB,YAAcF,SAASG,QAAQC,IAAI,iBAAmB,GAC5D,GAAI,yBAA0BN,aAAeI,YAAYjB,WAAW,oBAChED,aAAec,YAAYO,qBAAqBL,SAAUlB,UAEzD,CACD,MAAMwB,aAAeN,SAASO,cAC9BvB,aAAec,YAAYC,YAAYO,OAAQxB,KACnD,CACJ,CACA,OAAOE,OAAOwB,SAASC"}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@cfworker/json-schema/dist/esm/deep-compare-strict.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"deep-compare-strict.js","sources":["../../../../../../../../../../../../../node_modules/@cfworker/json-schema/dist/esm/deep-compare-strict.js"],"sourcesContent":["export function deepCompareStrict(a, b) {\n    const typeofa = typeof a;\n    if (typeofa !== typeof b) {\n        return false;\n    }\n    if (Array.isArray(a)) {\n        if (!Array.isArray(b)) {\n            return false;\n        }\n        const length = a.length;\n        if (length !== b.length) {\n            return false;\n        }\n        for (let i = 0; i < length; i++) {\n            if (!deepCompareStrict(a[i], b[i])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    if (typeofa === 'object') {\n        if (!a || !b) {\n            return a === b;\n        }\n        const aKeys = Object.keys(a);\n        const bKeys = Object.keys(b);\n        const length = aKeys.length;\n        if (length !== bKeys.length) {\n            return false;\n        }\n        for (const k of aKeys) {\n            if (!deepCompareStrict(a[k], b[k])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    return a === b;\n}\n"],"names":["deepCompareStrict","a","b","typeofa","Array","isArray","length","i","aKeys","Object","keys","bKeys","k"],"mappings":"AAAO,SAASA,kBAAkBC,EAAGC,GACjC,MAAMC,eAAiBF,EACvB,GAAIE,iBAAmBD,EACnB,OAAO,EAEX,GAAIE,MAAMC,QAAQJ,GAAI,CAClB,IAAKG,MAAMC,QAAQH,GACf,OAAO,EAEX,MAAMI,OAASL,EAAEK,OACjB,GAAIA,SAAWJ,EAAEI,OACb,OAAO,EAEX,IAAK,IAAIC,EAAI,EAAGA,EAAID,OAAQC,IACxB,IAAKP,kBAAkBC,EAAEM,GAAIL,EAAEK,IAC3B,OAAO,EAGf,OAAO,CACX,CACA,GAAgB,WAAZJ,QAAsB,CACtB,IAAKF,IAAMC,EACP,OAAOD,IAAMC,EAEjB,MAAMM,MAAQC,OAAOC,KAAKT,GACpBU,MAAQF,OAAOC,KAAKR,GAE1B,GADeM,MAAMF,SACNK,MAAML,OACjB,OAAO,EAEX,IAAK,MAAMM,KAAKJ,MACZ,IAAKR,kBAAkBC,EAAEW,GAAIV,EAAEU,IAC3B,OAAO,EAGf,OAAO,CACX,CACA,OAAOX,IAAMC,CACjB","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@cfworker/json-schema/dist/esm/dereference.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dereference.js","sources":["../../../../../../../../../../../../../node_modules/@cfworker/json-schema/dist/esm/dereference.js"],"sourcesContent":["import { encodePointer } from './pointer.js';\nexport const schemaKeyword = {\n    additionalItems: true,\n    unevaluatedItems: true,\n    items: true,\n    contains: true,\n    additionalProperties: true,\n    unevaluatedProperties: true,\n    propertyNames: true,\n    not: true,\n    if: true,\n    then: true,\n    else: true\n};\nexport const schemaArrayKeyword = {\n    prefixItems: true,\n    items: true,\n    allOf: true,\n    anyOf: true,\n    oneOf: true\n};\nexport const schemaMapKeyword = {\n    $defs: true,\n    definitions: true,\n    properties: true,\n    patternProperties: true,\n    dependentSchemas: true\n};\nexport const ignoredKeyword = {\n    id: true,\n    $id: true,\n    $ref: true,\n    $schema: true,\n    $anchor: true,\n    $vocabulary: true,\n    $comment: true,\n    default: true,\n    enum: true,\n    const: true,\n    required: true,\n    type: true,\n    maximum: true,\n    minimum: true,\n    exclusiveMaximum: true,\n    exclusiveMinimum: true,\n    multipleOf: true,\n    maxLength: true,\n    minLength: true,\n    pattern: true,\n    format: true,\n    maxItems: true,\n    minItems: true,\n    uniqueItems: true,\n    maxProperties: true,\n    minProperties: true\n};\nexport let initialBaseURI = typeof self !== 'undefined' &&\n    self.location &&\n    self.location.origin !== 'null'\n    ?\n        new URL(self.location.origin + self.location.pathname + location.search)\n    : new URL('https://github.com/cfworker');\nexport function dereference(schema, lookup = Object.create(null), baseURI = initialBaseURI, basePointer = '') {\n    if (schema && typeof schema === 'object' && !Array.isArray(schema)) {\n        const id = schema.$id || schema.id;\n        if (id) {\n            const url = new URL(id, baseURI.href);\n            if (url.hash.length > 1) {\n                lookup[url.href] = schema;\n            }\n            else {\n                url.hash = '';\n                if (basePointer === '') {\n                    baseURI = url;\n                }\n                else {\n                    dereference(schema, lookup, baseURI);\n                }\n            }\n        }\n    }\n    else if (schema !== true && schema !== false) {\n        return lookup;\n    }\n    const schemaURI = baseURI.href + (basePointer ? '#' + basePointer : '');\n    if (lookup[schemaURI] !== undefined) {\n        throw new Error(`Duplicate schema URI \"${schemaURI}\".`);\n    }\n    lookup[schemaURI] = schema;\n    if (schema === true || schema === false) {\n        return lookup;\n    }\n    if (schema.__absolute_uri__ === undefined) {\n        Object.defineProperty(schema, '__absolute_uri__', {\n            enumerable: false,\n            value: schemaURI\n        });\n    }\n    if (schema.$ref && schema.__absolute_ref__ === undefined) {\n        const url = new URL(schema.$ref, baseURI.href);\n        url.hash = url.hash;\n        Object.defineProperty(schema, '__absolute_ref__', {\n            enumerable: false,\n            value: url.href\n        });\n    }\n    if (schema.$recursiveRef && schema.__absolute_recursive_ref__ === undefined) {\n        const url = new URL(schema.$recursiveRef, baseURI.href);\n        url.hash = url.hash;\n        Object.defineProperty(schema, '__absolute_recursive_ref__', {\n            enumerable: false,\n            value: url.href\n        });\n    }\n    if (schema.$anchor) {\n        const url = new URL('#' + schema.$anchor, baseURI.href);\n        lookup[url.href] = schema;\n    }\n    for (let key in schema) {\n        if (ignoredKeyword[key]) {\n            continue;\n        }\n        const keyBase = `${basePointer}/${encodePointer(key)}`;\n        const subSchema = schema[key];\n        if (Array.isArray(subSchema)) {\n            if (schemaArrayKeyword[key]) {\n                const length = subSchema.length;\n                for (let i = 0; i < length; i++) {\n                    dereference(subSchema[i], lookup, baseURI, `${keyBase}/${i}`);\n                }\n            }\n        }\n        else if (schemaMapKeyword[key]) {\n            for (let subKey in subSchema) {\n                dereference(subSchema[subKey], lookup, baseURI, `${keyBase}/${encodePointer(subKey)}`);\n            }\n        }\n        else {\n            dereference(subSchema, lookup, baseURI, keyBase);\n        }\n    }\n    return lookup;\n}\n"],"names":["schemaArrayKeyword","prefixItems","items","allOf","anyOf","oneOf","schemaMapKeyword","$defs","definitions","properties","patternProperties","dependentSchemas","ignoredKeyword","id","$id","$ref","$schema","$anchor","$vocabulary","$comment","default","enum","const","required","type","maximum","minimum","exclusiveMaximum","exclusiveMinimum","multipleOf","maxLength","minLength","pattern","format","maxItems","minItems","uniqueItems","maxProperties","minProperties","initialBaseURI","self","location","origin","URL","pathname","search","dereference","schema","lookup","Object","create","baseURI","basePointer","Array","isArray","url","href","hash","length","schemaURI","undefined","Error","__absolute_uri__","defineProperty","enumerable","value","__absolute_ref__","$recursiveRef","__absolute_recursive_ref__","key","keyBase","encodePointer","subSchema","i","subKey"],"mappings":"wCAcY,MAACA,mBAAqB,CAC9BC,aAAa,EACbC,OAAO,EACPC,OAAO,EACPC,OAAO,EACPC,OAAO,GAEEC,iBAAmB,CAC5BC,OAAO,EACPC,aAAa,EACbC,YAAY,EACZC,mBAAmB,EACnBC,kBAAkB,GAETC,eAAiB,CAC1BC,IAAI,EACJC,KAAK,EACLC,MAAM,EACNC,SAAS,EACTC,SAAS,EACTC,aAAa,EACbC,UAAU,EACVC,SAAS,EACTC,MAAM,EACNC,OAAO,EACPC,UAAU,EACVC,MAAM,EACNC,SAAS,EACTC,SAAS,EACTC,kBAAkB,EAClBC,kBAAkB,EAClBC,YAAY,EACZC,WAAW,EACXC,WAAW,EACXC,SAAS,EACTC,QAAQ,EACRC,UAAU,EACVC,UAAU,EACVC,aAAa,EACbC,eAAe,EACfC,eAAe,GAET,IAACC,eAAiC,oBAATC,MAC/BA,KAAKC,UACoB,SAAzBD,KAAKC,SAASC,OAEV,IAAIC,IAAIH,KAAKC,SAASC,OAASF,KAAKC,SAASG,SAAWH,SAASI,QACnE,IAAIF,IAAI,+BACP,SAASG,YAAYC,OAAQC,OAASC,OAAOC,OAAO,MAAOC,QAAUZ,eAAgBa,YAAc,IACtG,GAAIL,QAA4B,iBAAXA,SAAwBM,MAAMC,QAAQP,QAAS,CAChE,MAAMlC,GAAKkC,OAAOjC,KAAOiC,OAAOlC,GAChC,GAAIA,GAAI,CACJ,MAAM0C,IAAM,IAAIZ,IAAI9B,GAAIsC,QAAQK,MAC5BD,IAAIE,KAAKC,OAAS,EAClBV,OAAOO,IAAIC,MAAQT,QAGnBQ,IAAIE,KAAO,GACS,KAAhBL,YACAD,QAAUI,IAGVT,YAAYC,OAAQC,OAAQG,SAGxC,CACJ,MACK,IAAe,IAAXJ,SAA8B,IAAXA,OACxB,OAAOC,OAEX,MAAMW,UAAYR,QAAQK,MAAQJ,YAAc,IAAMA,YAAc,IACpE,QAA0BQ,IAAtBZ,OAAOW,WACP,MAAM,IAAIE,MAAM,yBAAyBF,eAG7C,GADAX,OAAOW,WAAaZ,QACL,IAAXA,SAA8B,IAAXA,OACnB,OAAOC,OAQX,QANgCY,IAA5Bb,OAAOe,kBACPb,OAAOc,eAAehB,OAAQ,mBAAoB,CAC9CiB,YAAY,EACZC,MAAON,YAGXZ,OAAOhC,WAAoC6C,IAA5Bb,OAAOmB,iBAAgC,CACtD,MAAMX,IAAM,IAAIZ,IAAII,OAAOhC,KAAMoC,QAAQK,MACzCD,IAAIE,KAAOF,IAAIE,KACfR,OAAOc,eAAehB,OAAQ,mBAAoB,CAC9CiB,YAAY,EACZC,MAAOV,IAAIC,MAEnB,CACA,GAAIT,OAAOoB,oBAAuDP,IAAtCb,OAAOqB,2BAA0C,CACzE,MAAMb,IAAM,IAAIZ,IAAII,OAAOoB,cAAehB,QAAQK,MAClDD,IAAIE,KAAOF,IAAIE,KACfR,OAAOc,eAAehB,OAAQ,6BAA8B,CACxDiB,YAAY,EACZC,MAAOV,IAAIC,MAEnB,CACIT,OAAO9B,UAEP+B,OADY,IAAIL,IAAI,IAAMI,OAAO9B,QAASkC,QAAQK,MACvCA,MAAQT,QAEvB,IAAK,IAAIsB,OAAOtB,OAAQ,CACpB,GAAInC,eAAeyD,KACf,SAEJ,MAAMC,QAAU,GAAGlB,eAAemB,cAAcF,OAC1CG,UAAYzB,OAAOsB,KACzB,GAAIhB,MAAMC,QAAQkB,YACd,GAAIxE,mBAAmBqE,KAAM,CACzB,MAAMX,OAASc,UAAUd,OACzB,IAAK,IAAIe,EAAI,EAAGA,EAAIf,OAAQe,IACxB3B,YAAY0B,UAAUC,GAAIzB,OAAQG,QAAS,GAAGmB,WAAWG,IAEjE,OAEC,GAAInE,iBAAiB+D,KACtB,IAAK,IAAIK,UAAUF,UACf1B,YAAY0B,UAAUE,QAAS1B,OAAQG,QAAS,GAAGmB,WAAWC,cAAcG,gBAIhF5B,YAAY0B,UAAWxB,OAAQG,QAASmB,QAEhD,CACA,OAAOtB,MACX","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@cfworker/json-schema/dist/esm/format.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"format.js","sources":["../../../../../../../../../../../../../node_modules/@cfworker/json-schema/dist/esm/format.js"],"sourcesContent":["const DATE = /^(\\d\\d\\d\\d)-(\\d\\d)-(\\d\\d)$/;\nconst DAYS = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];\nconst TIME = /^(\\d\\d):(\\d\\d):(\\d\\d)(\\.\\d+)?(z|[+-]\\d\\d(?::?\\d\\d)?)?$/i;\nconst HOSTNAME = /^(?=.{1,253}\\.?$)[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\\.[a-z0-9](?:[-0-9a-z]{0,61}[0-9a-z])?)*\\.?$/i;\nconst URIREF = /^(?:[a-z][a-z0-9+\\-.]*:)?(?:\\/?\\/(?:(?:[a-z0-9\\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?)\\.){3}(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\\.[a-z0-9\\-._~!$&'()*+,;=:]+)\\]|(?:(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?)\\.){3}(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?)|(?:[a-z0-9\\-._~!$&'\"()*+,;=]|%[0-9a-f]{2})*)(?::\\d*)?(?:\\/(?:[a-z0-9\\-._~!$&'\"()*+,;=:@]|%[0-9a-f]{2})*)*|\\/(?:(?:[a-z0-9\\-._~!$&'\"()*+,;=:@]|%[0-9a-f]{2})+(?:\\/(?:[a-z0-9\\-._~!$&'\"()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\\-._~!$&'\"()*+,;=:@]|%[0-9a-f]{2})+(?:\\/(?:[a-z0-9\\-._~!$&'\"()*+,;=:@]|%[0-9a-f]{2})*)*)?(?:\\?(?:[a-z0-9\\-._~!$&'\"()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\\-._~!$&'\"()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;\nconst URITEMPLATE = /^(?:(?:[^\\x00-\\x20\"'<>%\\\\^`{|}]|%[0-9a-f]{2})|\\{[+#./;?&=,!@|]?(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\\*)?(?:,(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\\*)?)*\\})*$/i;\nconst URL_ = /^(?:(?:https?|ftp):\\/\\/)(?:\\S+(?::\\S*)?@)?(?:(?!10(?:\\.\\d{1,3}){3})(?!127(?:\\.\\d{1,3}){3})(?!169\\.254(?:\\.\\d{1,3}){2})(?!192\\.168(?:\\.\\d{1,3}){2})(?!172\\.(?:1[6-9]|2\\d|3[0-1])(?:\\.\\d{1,3}){2})(?:[1-9]\\d?|1\\d\\d|2[01]\\d|22[0-3])(?:\\.(?:1?\\d{1,2}|2[0-4]\\d|25[0-5])){2}(?:\\.(?:[1-9]\\d?|1\\d\\d|2[0-4]\\d|25[0-4]))|(?:(?:[a-z\\u{00a1}-\\u{ffff}0-9]+-?)*[a-z\\u{00a1}-\\u{ffff}0-9]+)(?:\\.(?:[a-z\\u{00a1}-\\u{ffff}0-9]+-?)*[a-z\\u{00a1}-\\u{ffff}0-9]+)*(?:\\.(?:[a-z\\u{00a1}-\\u{ffff}]{2,})))(?::\\d{2,5})?(?:\\/[^\\s]*)?$/iu;\nconst UUID = /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i;\nconst JSON_POINTER = /^(?:\\/(?:[^~/]|~0|~1)*)*$/;\nconst JSON_POINTER_URI_FRAGMENT = /^#(?:\\/(?:[a-z0-9_\\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i;\nconst RELATIVE_JSON_POINTER = /^(?:0|[1-9][0-9]*)(?:#|(?:\\/(?:[^~/]|~0|~1)*)*)$/;\nconst EMAIL = (input) => {\n    if (input[0] === '\"')\n        return false;\n    const [name, host, ...rest] = input.split('@');\n    if (!name ||\n        !host ||\n        rest.length !== 0 ||\n        name.length > 64 ||\n        host.length > 253)\n        return false;\n    if (name[0] === '.' || name.endsWith('.') || name.includes('..'))\n        return false;\n    if (!/^[a-z0-9.-]+$/i.test(host) ||\n        !/^[a-z0-9.!#$%&'*+/=?^_`{|}~-]+$/i.test(name))\n        return false;\n    return host\n        .split('.')\n        .every(part => /^[a-z0-9]([a-z0-9-]{0,61}[a-z0-9])?$/i.test(part));\n};\nconst IPV4 = /^(?:(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?)\\.){3}(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?)$/;\nconst IPV6 = /^((([0-9a-f]{1,4}:){7}([0-9a-f]{1,4}|:))|(([0-9a-f]{1,4}:){6}(:[0-9a-f]{1,4}|((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3})|:))|(([0-9a-f]{1,4}:){5}(((:[0-9a-f]{1,4}){1,2})|:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3})|:))|(([0-9a-f]{1,4}:){4}(((:[0-9a-f]{1,4}){1,3})|((:[0-9a-f]{1,4})?:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:))|(([0-9a-f]{1,4}:){3}(((:[0-9a-f]{1,4}){1,4})|((:[0-9a-f]{1,4}){0,2}:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:))|(([0-9a-f]{1,4}:){2}(((:[0-9a-f]{1,4}){1,5})|((:[0-9a-f]{1,4}){0,3}:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:))|(([0-9a-f]{1,4}:){1}(((:[0-9a-f]{1,4}){1,6})|((:[0-9a-f]{1,4}){0,4}:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:))|(:(((:[0-9a-f]{1,4}){1,7})|((:[0-9a-f]{1,4}){0,5}:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:)))$/i;\nconst DURATION = (input) => input.length > 1 &&\n    input.length < 80 &&\n    (/^P\\d+([.,]\\d+)?W$/.test(input) ||\n        (/^P[\\dYMDTHS]*(\\d[.,]\\d+)?[YMDHS]$/.test(input) &&\n            /^P([.,\\d]+Y)?([.,\\d]+M)?([.,\\d]+D)?(T([.,\\d]+H)?([.,\\d]+M)?([.,\\d]+S)?)?$/.test(input)));\nfunction bind(r) {\n    return r.test.bind(r);\n}\nexport const format = {\n    date,\n    time: time.bind(undefined, false),\n    'date-time': date_time,\n    duration: DURATION,\n    uri,\n    'uri-reference': bind(URIREF),\n    'uri-template': bind(URITEMPLATE),\n    url: bind(URL_),\n    email: EMAIL,\n    hostname: bind(HOSTNAME),\n    ipv4: bind(IPV4),\n    ipv6: bind(IPV6),\n    regex: regex,\n    uuid: bind(UUID),\n    'json-pointer': bind(JSON_POINTER),\n    'json-pointer-uri-fragment': bind(JSON_POINTER_URI_FRAGMENT),\n    'relative-json-pointer': bind(RELATIVE_JSON_POINTER)\n};\nfunction isLeapYear(year) {\n    return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);\n}\nfunction date(str) {\n    const matches = str.match(DATE);\n    if (!matches)\n        return false;\n    const year = +matches[1];\n    const month = +matches[2];\n    const day = +matches[3];\n    return (month >= 1 &&\n        month <= 12 &&\n        day >= 1 &&\n        day <= (month == 2 && isLeapYear(year) ? 29 : DAYS[month]));\n}\nfunction time(full, str) {\n    const matches = str.match(TIME);\n    if (!matches)\n        return false;\n    const hour = +matches[1];\n    const minute = +matches[2];\n    const second = +matches[3];\n    const timeZone = !!matches[5];\n    return (((hour <= 23 && minute <= 59 && second <= 59) ||\n        (hour == 23 && minute == 59 && second == 60)) &&\n        (!full || timeZone));\n}\nconst DATE_TIME_SEPARATOR = /t|\\s/i;\nfunction date_time(str) {\n    const dateTime = str.split(DATE_TIME_SEPARATOR);\n    return dateTime.length == 2 && date(dateTime[0]) && time(true, dateTime[1]);\n}\nconst NOT_URI_FRAGMENT = /\\/|:/;\nconst URI_PATTERN = /^(?:[a-z][a-z0-9+\\-.]*:)(?:\\/?\\/(?:(?:[a-z0-9\\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?)\\.){3}(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\\.[a-z0-9\\-._~!$&'()*+,;=:]+)\\]|(?:(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?)\\.){3}(?:25[0-5]|2[0-4]\\d|[01]?\\d\\d?)|(?:[a-z0-9\\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\\d*)?(?:\\/(?:[a-z0-9\\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\\/(?:(?:[a-z0-9\\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\\/(?:[a-z0-9\\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\\/(?:[a-z0-9\\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\\?(?:[a-z0-9\\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;\nfunction uri(str) {\n    return NOT_URI_FRAGMENT.test(str) && URI_PATTERN.test(str);\n}\nconst Z_ANCHOR = /[^\\\\]\\\\Z/;\nfunction regex(str) {\n    if (Z_ANCHOR.test(str))\n        return false;\n    try {\n        new RegExp(str, 'u');\n        return true;\n    }\n    catch (e) {\n        return false;\n    }\n}\n"],"names":["DATE","DAYS","TIME","bind","r","test","format","date","time","undefined","str","dateTime","split","DATE_TIME_SEPARATOR","length","duration","input","uri","NOT_URI_FRAGMENT","URI_PATTERN","url","email","name","host","rest","endsWith","includes","every","part","hostname","ipv4","ipv6","regex","Z_ANCHOR","RegExp","e","uuid","matches","match","month","day","year","full","hour","minute","second"],"mappings":"AAAA,MAAMA,KAAO,6BACPC,KAAO,CAAC,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IACvDC,KAAO,0DAmCb,SAASC,KAAKC,GACV,OAAOA,EAAEC,KAAKF,KAAKC,EACvB,CACY,MAACE,OAAS,CAClBC,UACAC,KAAMA,KAAKL,UAAKM,GAAW,GAC3B,YA4CJ,SAAmBC,KACf,MAAMC,SAAWD,IAAIE,MAAMC,qBAC3B,OAA0B,GAAnBF,SAASG,QAAeP,KAAKI,SAAS,KAAOH,MAAK,EAAMG,SAAS,GAC5E,EA9CII,SAZcC,OAAUA,MAAMF,OAAS,GACvCE,MAAMF,OAAS,KACd,oBAAoBT,KAAKW,QACrB,oCAAoCX,KAAKW,QACtC,4EAA4EX,KAAKW,QASzFC,IAgDJ,SAAaP,KACT,OAAOQ,iBAAiBb,KAAKK,MAAQS,YAAYd,KAAKK,IAC1D,EAjDI,gBAAiBP,KA1CN,0oCA2CX,eAAgBA,KA1CA,qLA2ChBiB,IAAKjB,KA1CI,0fA2CTkB,MAtCWL,QACX,GAAiB,MAAbA,MAAM,GACN,OAAO,EACX,MAAOM,KAAMC,QAASC,MAAQR,MAAMJ,MAAM,KAC1C,SAAKU,OACAC,MACe,IAAhBC,KAAKV,QACLQ,KAAKR,OAAS,IACdS,KAAKT,OAAS,MAEF,MAAZQ,KAAK,KAAcA,KAAKG,SAAS,OAAQH,KAAKI,SAAS,UAEtD,iBAAiBrB,KAAKkB,QACtB,mCAAmClB,KAAKiB,QAEtCC,KACFX,MAAM,KACNe,MAAMC,MAAQ,wCAAwCvB,KAAKuB,QAsBhEC,SAAU1B,KA/CG,yGAgDb2B,KAAM3B,KArBG,6EAsBT4B,KAAM5B,KArBG,o/BAsBT6B,MA4CJ,SAAetB,KACX,GAAIuB,SAAS5B,KAAKK,KACd,OAAO,EACX,IAEI,OADA,IAAIwB,OAAOxB,IAAK,MACT,CACX,CACA,MAAOyB,GACH,OAAO,CACX,CACJ,EArDIC,KAAMjC,KA/CG,gEAgDT,eAAgBA,KA/CC,6BAgDjB,4BAA6BA,KA/CC,gEAgD9B,wBAAyBA,KA/CC,qDAoD9B,SAASI,KAAKG,KACV,MAAM2B,QAAU3B,IAAI4B,MAAMtC,MAC1B,IAAKqC,QACD,OAAO,EACX,MACME,OAASF,QAAQ,GACjBG,KAAOH,QAAQ,GACrB,OAAQE,OAAS,GACbA,OAAS,IACTC,KAAO,GACPA,MAAiB,GAATD,QAbIE,MAOFJ,QAAQ,IANR,GAAM,GAAMI,KAAO,KAAQ,GAAKA,KAAO,KAAQ,EAYXxC,KAAKsC,OAAV,IAbjD,IAAoBE,IAcpB,CACA,SAASjC,KAAKkC,KAAMhC,KAChB,MAAM2B,QAAU3B,IAAI4B,MAAMpC,MAC1B,IAAKmC,QACD,OAAO,EACX,MAAMM,MAAQN,QAAQ,GAChBO,QAAUP,QAAQ,GAClBQ,QAAUR,QAAQ,GAExB,OAAUM,MAAQ,IAAMC,QAAU,IAAMC,QAAU,IACrC,IAARF,MAAwB,IAAVC,QAA0B,IAAVC,WAC7BH,QAHaL,QAAQ,GAI/B,CACA,MAAMxB,oBAAsB,QAKtBK,iBAAmB,OACnBC,YAAc,+nCAIdc,SAAW","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@cfworker/json-schema/dist/esm/pointer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pointer.js","sources":["../../../../../../../../../../../../../node_modules/@cfworker/json-schema/dist/esm/pointer.js"],"sourcesContent":["export function encodePointer(p) {\n    return encodeURI(escapePointer(p));\n}\nexport function escapePointer(p) {\n    return p.replace(/~/g, '~0').replace(/\\//g, '~1');\n}\n"],"names":["encodePointer","p","encodeURI","escapePointer","replace"],"mappings":"AAAO,SAASA,cAAcC,GAC1B,OAAOC,UAAUC,cAAcF,GACnC,CACO,SAASE,cAAcF,GAC1B,OAAOA,EAAEG,QAAQ,KAAM,MAAMA,QAAQ,MAAO,KAChD","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@cfworker/json-schema/dist/esm/ucs2-length.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ucs2-length.js","sources":["../../../../../../../../../../../../../node_modules/@cfworker/json-schema/dist/esm/ucs2-length.js"],"sourcesContent":["export function ucs2length(s) {\n    let result = 0;\n    let length = s.length;\n    let index = 0;\n    let charCode;\n    while (index < length) {\n        result++;\n        charCode = s.charCodeAt(index++);\n        if (charCode >= 0xd800 && charCode <= 0xdbff && index < length) {\n            charCode = s.charCodeAt(index);\n            if ((charCode & 0xfc00) == 0xdc00) {\n                index++;\n            }\n        }\n    }\n    return result;\n}\n"],"names":["ucs2length","s","charCode","result","length","index","charCodeAt"],"mappings":"AAAO,SAASA,WAAWC,GACvB,IAGIC,SAHAC,OAAS,EACTC,OAASH,EAAEG,OACXC,MAAQ,EAEZ,KAAOA,MAAQD,QACXD,SACAD,SAAWD,EAAEK,WAAWD,SACpBH,UAAY,OAAUA,UAAY,OAAUG,MAAQD,SACpDF,SAAWD,EAAEK,WAAWD,OACG,QAAX,MAAXH,WACDG,SAIZ,OAAOF,MACX","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@cfworker/json-schema/dist/esm/validate.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"validate.js","sources":["../../../../../../../../../../../../../node_modules/@cfworker/json-schema/dist/esm/validate.js"],"sourcesContent":["import { deepCompareStrict } from './deep-compare-strict.js';\nimport { dereference } from './dereference.js';\nimport { format } from './format.js';\nimport { encodePointer } from './pointer.js';\nimport { ucs2length } from './ucs2-length.js';\nexport function validate(instance, schema, draft = '2019-09', lookup = dereference(schema), shortCircuit = true, recursiveAnchor = null, instanceLocation = '#', schemaLocation = '#', evaluated = Object.create(null)) {\n    if (schema === true) {\n        return { valid: true, errors: [] };\n    }\n    if (schema === false) {\n        return {\n            valid: false,\n            errors: [\n                {\n                    instanceLocation,\n                    keyword: 'false',\n                    keywordLocation: instanceLocation,\n                    error: 'False boolean schema.'\n                }\n            ]\n        };\n    }\n    const rawInstanceType = typeof instance;\n    let instanceType;\n    switch (rawInstanceType) {\n        case 'boolean':\n        case 'number':\n        case 'string':\n            instanceType = rawInstanceType;\n            break;\n        case 'object':\n            if (instance === null) {\n                instanceType = 'null';\n            }\n            else if (Array.isArray(instance)) {\n                instanceType = 'array';\n            }\n            else {\n                instanceType = 'object';\n            }\n            break;\n        default:\n            throw new Error(`Instances of \"${rawInstanceType}\" type are not supported.`);\n    }\n    const { $ref, $recursiveRef, $recursiveAnchor, type: $type, const: $const, enum: $enum, required: $required, not: $not, anyOf: $anyOf, allOf: $allOf, oneOf: $oneOf, if: $if, then: $then, else: $else, format: $format, properties: $properties, patternProperties: $patternProperties, additionalProperties: $additionalProperties, unevaluatedProperties: $unevaluatedProperties, minProperties: $minProperties, maxProperties: $maxProperties, propertyNames: $propertyNames, dependentRequired: $dependentRequired, dependentSchemas: $dependentSchemas, dependencies: $dependencies, prefixItems: $prefixItems, items: $items, additionalItems: $additionalItems, unevaluatedItems: $unevaluatedItems, contains: $contains, minContains: $minContains, maxContains: $maxContains, minItems: $minItems, maxItems: $maxItems, uniqueItems: $uniqueItems, minimum: $minimum, maximum: $maximum, exclusiveMinimum: $exclusiveMinimum, exclusiveMaximum: $exclusiveMaximum, multipleOf: $multipleOf, minLength: $minLength, maxLength: $maxLength, pattern: $pattern, __absolute_ref__, __absolute_recursive_ref__ } = schema;\n    const errors = [];\n    if ($recursiveAnchor === true && recursiveAnchor === null) {\n        recursiveAnchor = schema;\n    }\n    if ($recursiveRef === '#') {\n        const refSchema = recursiveAnchor === null\n            ? lookup[__absolute_recursive_ref__]\n            : recursiveAnchor;\n        const keywordLocation = `${schemaLocation}/$recursiveRef`;\n        const result = validate(instance, recursiveAnchor === null ? schema : recursiveAnchor, draft, lookup, shortCircuit, refSchema, instanceLocation, keywordLocation, evaluated);\n        if (!result.valid) {\n            errors.push({\n                instanceLocation,\n                keyword: '$recursiveRef',\n                keywordLocation,\n                error: 'A subschema had errors.'\n            }, ...result.errors);\n        }\n    }\n    if ($ref !== undefined) {\n        const uri = __absolute_ref__ || $ref;\n        const refSchema = lookup[uri];\n        if (refSchema === undefined) {\n            let message = `Unresolved $ref \"${$ref}\".`;\n            if (__absolute_ref__ && __absolute_ref__ !== $ref) {\n                message += `  Absolute URI \"${__absolute_ref__}\".`;\n            }\n            message += `\\nKnown schemas:\\n- ${Object.keys(lookup).join('\\n- ')}`;\n            throw new Error(message);\n        }\n        const keywordLocation = `${schemaLocation}/$ref`;\n        const result = validate(instance, refSchema, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, keywordLocation, evaluated);\n        if (!result.valid) {\n            errors.push({\n                instanceLocation,\n                keyword: '$ref',\n                keywordLocation,\n                error: 'A subschema had errors.'\n            }, ...result.errors);\n        }\n        if (draft === '4' || draft === '7') {\n            return { valid: errors.length === 0, errors };\n        }\n    }\n    if (Array.isArray($type)) {\n        let length = $type.length;\n        let valid = false;\n        for (let i = 0; i < length; i++) {\n            if (instanceType === $type[i] ||\n                ($type[i] === 'integer' &&\n                    instanceType === 'number' &&\n                    instance % 1 === 0 &&\n                    instance === instance)) {\n                valid = true;\n                break;\n            }\n        }\n        if (!valid) {\n            errors.push({\n                instanceLocation,\n                keyword: 'type',\n                keywordLocation: `${schemaLocation}/type`,\n                error: `Instance type \"${instanceType}\" is invalid. Expected \"${$type.join('\", \"')}\".`\n            });\n        }\n    }\n    else if ($type === 'integer') {\n        if (instanceType !== 'number' || instance % 1 || instance !== instance) {\n            errors.push({\n                instanceLocation,\n                keyword: 'type',\n                keywordLocation: `${schemaLocation}/type`,\n                error: `Instance type \"${instanceType}\" is invalid. Expected \"${$type}\".`\n            });\n        }\n    }\n    else if ($type !== undefined && instanceType !== $type) {\n        errors.push({\n            instanceLocation,\n            keyword: 'type',\n            keywordLocation: `${schemaLocation}/type`,\n            error: `Instance type \"${instanceType}\" is invalid. Expected \"${$type}\".`\n        });\n    }\n    if ($const !== undefined) {\n        if (instanceType === 'object' || instanceType === 'array') {\n            if (!deepCompareStrict(instance, $const)) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'const',\n                    keywordLocation: `${schemaLocation}/const`,\n                    error: `Instance does not match ${JSON.stringify($const)}.`\n                });\n            }\n        }\n        else if (instance !== $const) {\n            errors.push({\n                instanceLocation,\n                keyword: 'const',\n                keywordLocation: `${schemaLocation}/const`,\n                error: `Instance does not match ${JSON.stringify($const)}.`\n            });\n        }\n    }\n    if ($enum !== undefined) {\n        if (instanceType === 'object' || instanceType === 'array') {\n            if (!$enum.some(value => deepCompareStrict(instance, value))) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'enum',\n                    keywordLocation: `${schemaLocation}/enum`,\n                    error: `Instance does not match any of ${JSON.stringify($enum)}.`\n                });\n            }\n        }\n        else if (!$enum.some(value => instance === value)) {\n            errors.push({\n                instanceLocation,\n                keyword: 'enum',\n                keywordLocation: `${schemaLocation}/enum`,\n                error: `Instance does not match any of ${JSON.stringify($enum)}.`\n            });\n        }\n    }\n    if ($not !== undefined) {\n        const keywordLocation = `${schemaLocation}/not`;\n        const result = validate(instance, $not, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, keywordLocation);\n        if (result.valid) {\n            errors.push({\n                instanceLocation,\n                keyword: 'not',\n                keywordLocation,\n                error: 'Instance matched \"not\" schema.'\n            });\n        }\n    }\n    let subEvaluateds = [];\n    if ($anyOf !== undefined) {\n        const keywordLocation = `${schemaLocation}/anyOf`;\n        const errorsLength = errors.length;\n        let anyValid = false;\n        for (let i = 0; i < $anyOf.length; i++) {\n            const subSchema = $anyOf[i];\n            const subEvaluated = Object.create(evaluated);\n            const result = validate(instance, subSchema, draft, lookup, shortCircuit, $recursiveAnchor === true ? recursiveAnchor : null, instanceLocation, `${keywordLocation}/${i}`, subEvaluated);\n            errors.push(...result.errors);\n            anyValid = anyValid || result.valid;\n            if (result.valid) {\n                subEvaluateds.push(subEvaluated);\n            }\n        }\n        if (anyValid) {\n            errors.length = errorsLength;\n        }\n        else {\n            errors.splice(errorsLength, 0, {\n                instanceLocation,\n                keyword: 'anyOf',\n                keywordLocation,\n                error: 'Instance does not match any subschemas.'\n            });\n        }\n    }\n    if ($allOf !== undefined) {\n        const keywordLocation = `${schemaLocation}/allOf`;\n        const errorsLength = errors.length;\n        let allValid = true;\n        for (let i = 0; i < $allOf.length; i++) {\n            const subSchema = $allOf[i];\n            const subEvaluated = Object.create(evaluated);\n            const result = validate(instance, subSchema, draft, lookup, shortCircuit, $recursiveAnchor === true ? recursiveAnchor : null, instanceLocation, `${keywordLocation}/${i}`, subEvaluated);\n            errors.push(...result.errors);\n            allValid = allValid && result.valid;\n            if (result.valid) {\n                subEvaluateds.push(subEvaluated);\n            }\n        }\n        if (allValid) {\n            errors.length = errorsLength;\n        }\n        else {\n            errors.splice(errorsLength, 0, {\n                instanceLocation,\n                keyword: 'allOf',\n                keywordLocation,\n                error: `Instance does not match every subschema.`\n            });\n        }\n    }\n    if ($oneOf !== undefined) {\n        const keywordLocation = `${schemaLocation}/oneOf`;\n        const errorsLength = errors.length;\n        const matches = $oneOf.filter((subSchema, i) => {\n            const subEvaluated = Object.create(evaluated);\n            const result = validate(instance, subSchema, draft, lookup, shortCircuit, $recursiveAnchor === true ? recursiveAnchor : null, instanceLocation, `${keywordLocation}/${i}`, subEvaluated);\n            errors.push(...result.errors);\n            if (result.valid) {\n                subEvaluateds.push(subEvaluated);\n            }\n            return result.valid;\n        }).length;\n        if (matches === 1) {\n            errors.length = errorsLength;\n        }\n        else {\n            errors.splice(errorsLength, 0, {\n                instanceLocation,\n                keyword: 'oneOf',\n                keywordLocation,\n                error: `Instance does not match exactly one subschema (${matches} matches).`\n            });\n        }\n    }\n    if (instanceType === 'object' || instanceType === 'array') {\n        Object.assign(evaluated, ...subEvaluateds);\n    }\n    if ($if !== undefined) {\n        const keywordLocation = `${schemaLocation}/if`;\n        const conditionResult = validate(instance, $if, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, keywordLocation, evaluated).valid;\n        if (conditionResult) {\n            if ($then !== undefined) {\n                const thenResult = validate(instance, $then, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${schemaLocation}/then`, evaluated);\n                if (!thenResult.valid) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'if',\n                        keywordLocation,\n                        error: `Instance does not match \"then\" schema.`\n                    }, ...thenResult.errors);\n                }\n            }\n        }\n        else if ($else !== undefined) {\n            const elseResult = validate(instance, $else, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${schemaLocation}/else`, evaluated);\n            if (!elseResult.valid) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'if',\n                    keywordLocation,\n                    error: `Instance does not match \"else\" schema.`\n                }, ...elseResult.errors);\n            }\n        }\n    }\n    if (instanceType === 'object') {\n        if ($required !== undefined) {\n            for (const key of $required) {\n                if (!(key in instance)) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'required',\n                        keywordLocation: `${schemaLocation}/required`,\n                        error: `Instance does not have required property \"${key}\".`\n                    });\n                }\n            }\n        }\n        const keys = Object.keys(instance);\n        if ($minProperties !== undefined && keys.length < $minProperties) {\n            errors.push({\n                instanceLocation,\n                keyword: 'minProperties',\n                keywordLocation: `${schemaLocation}/minProperties`,\n                error: `Instance does not have at least ${$minProperties} properties.`\n            });\n        }\n        if ($maxProperties !== undefined && keys.length > $maxProperties) {\n            errors.push({\n                instanceLocation,\n                keyword: 'maxProperties',\n                keywordLocation: `${schemaLocation}/maxProperties`,\n                error: `Instance does not have at least ${$maxProperties} properties.`\n            });\n        }\n        if ($propertyNames !== undefined) {\n            const keywordLocation = `${schemaLocation}/propertyNames`;\n            for (const key in instance) {\n                const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                const result = validate(key, $propertyNames, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, keywordLocation);\n                if (!result.valid) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'propertyNames',\n                        keywordLocation,\n                        error: `Property name \"${key}\" does not match schema.`\n                    }, ...result.errors);\n                }\n            }\n        }\n        if ($dependentRequired !== undefined) {\n            const keywordLocation = `${schemaLocation}/dependantRequired`;\n            for (const key in $dependentRequired) {\n                if (key in instance) {\n                    const required = $dependentRequired[key];\n                    for (const dependantKey of required) {\n                        if (!(dependantKey in instance)) {\n                            errors.push({\n                                instanceLocation,\n                                keyword: 'dependentRequired',\n                                keywordLocation,\n                                error: `Instance has \"${key}\" but does not have \"${dependantKey}\".`\n                            });\n                        }\n                    }\n                }\n            }\n        }\n        if ($dependentSchemas !== undefined) {\n            for (const key in $dependentSchemas) {\n                const keywordLocation = `${schemaLocation}/dependentSchemas`;\n                if (key in instance) {\n                    const result = validate(instance, $dependentSchemas[key], draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${keywordLocation}/${encodePointer(key)}`, evaluated);\n                    if (!result.valid) {\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'dependentSchemas',\n                            keywordLocation,\n                            error: `Instance has \"${key}\" but does not match dependant schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n        if ($dependencies !== undefined) {\n            const keywordLocation = `${schemaLocation}/dependencies`;\n            for (const key in $dependencies) {\n                if (key in instance) {\n                    const propsOrSchema = $dependencies[key];\n                    if (Array.isArray(propsOrSchema)) {\n                        for (const dependantKey of propsOrSchema) {\n                            if (!(dependantKey in instance)) {\n                                errors.push({\n                                    instanceLocation,\n                                    keyword: 'dependencies',\n                                    keywordLocation,\n                                    error: `Instance has \"${key}\" but does not have \"${dependantKey}\".`\n                                });\n                            }\n                        }\n                    }\n                    else {\n                        const result = validate(instance, propsOrSchema, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${keywordLocation}/${encodePointer(key)}`);\n                        if (!result.valid) {\n                            errors.push({\n                                instanceLocation,\n                                keyword: 'dependencies',\n                                keywordLocation,\n                                error: `Instance has \"${key}\" but does not match dependant schema.`\n                            }, ...result.errors);\n                        }\n                    }\n                }\n            }\n        }\n        const thisEvaluated = Object.create(null);\n        let stop = false;\n        if ($properties !== undefined) {\n            const keywordLocation = `${schemaLocation}/properties`;\n            for (const key in $properties) {\n                if (!(key in instance)) {\n                    continue;\n                }\n                const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                const result = validate(instance[key], $properties[key], draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, `${keywordLocation}/${encodePointer(key)}`);\n                if (result.valid) {\n                    evaluated[key] = thisEvaluated[key] = true;\n                }\n                else {\n                    stop = shortCircuit;\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'properties',\n                        keywordLocation,\n                        error: `Property \"${key}\" does not match schema.`\n                    }, ...result.errors);\n                    if (stop)\n                        break;\n                }\n            }\n        }\n        if (!stop && $patternProperties !== undefined) {\n            const keywordLocation = `${schemaLocation}/patternProperties`;\n            for (const pattern in $patternProperties) {\n                const regex = new RegExp(pattern, 'u');\n                const subSchema = $patternProperties[pattern];\n                for (const key in instance) {\n                    if (!regex.test(key)) {\n                        continue;\n                    }\n                    const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                    const result = validate(instance[key], subSchema, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, `${keywordLocation}/${encodePointer(pattern)}`);\n                    if (result.valid) {\n                        evaluated[key] = thisEvaluated[key] = true;\n                    }\n                    else {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'patternProperties',\n                            keywordLocation,\n                            error: `Property \"${key}\" matches pattern \"${pattern}\" but does not match associated schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n        if (!stop && $additionalProperties !== undefined) {\n            const keywordLocation = `${schemaLocation}/additionalProperties`;\n            for (const key in instance) {\n                if (thisEvaluated[key]) {\n                    continue;\n                }\n                const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                const result = validate(instance[key], $additionalProperties, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, keywordLocation);\n                if (result.valid) {\n                    evaluated[key] = true;\n                }\n                else {\n                    stop = shortCircuit;\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'additionalProperties',\n                        keywordLocation,\n                        error: `Property \"${key}\" does not match additional properties schema.`\n                    }, ...result.errors);\n                }\n            }\n        }\n        else if (!stop && $unevaluatedProperties !== undefined) {\n            const keywordLocation = `${schemaLocation}/unevaluatedProperties`;\n            for (const key in instance) {\n                if (!evaluated[key]) {\n                    const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                    const result = validate(instance[key], $unevaluatedProperties, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, keywordLocation);\n                    if (result.valid) {\n                        evaluated[key] = true;\n                    }\n                    else {\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'unevaluatedProperties',\n                            keywordLocation,\n                            error: `Property \"${key}\" does not match unevaluated properties schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n    }\n    else if (instanceType === 'array') {\n        if ($maxItems !== undefined && instance.length > $maxItems) {\n            errors.push({\n                instanceLocation,\n                keyword: 'maxItems',\n                keywordLocation: `${schemaLocation}/maxItems`,\n                error: `Array has too many items (${instance.length} > ${$maxItems}).`\n            });\n        }\n        if ($minItems !== undefined && instance.length < $minItems) {\n            errors.push({\n                instanceLocation,\n                keyword: 'minItems',\n                keywordLocation: `${schemaLocation}/minItems`,\n                error: `Array has too few items (${instance.length} < ${$minItems}).`\n            });\n        }\n        const length = instance.length;\n        let i = 0;\n        let stop = false;\n        if ($prefixItems !== undefined) {\n            const keywordLocation = `${schemaLocation}/prefixItems`;\n            const length2 = Math.min($prefixItems.length, length);\n            for (; i < length2; i++) {\n                const result = validate(instance[i], $prefixItems[i], draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, `${keywordLocation}/${i}`);\n                evaluated[i] = true;\n                if (!result.valid) {\n                    stop = shortCircuit;\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'prefixItems',\n                        keywordLocation,\n                        error: `Items did not match schema.`\n                    }, ...result.errors);\n                    if (stop)\n                        break;\n                }\n            }\n        }\n        if ($items !== undefined) {\n            const keywordLocation = `${schemaLocation}/items`;\n            if (Array.isArray($items)) {\n                const length2 = Math.min($items.length, length);\n                for (; i < length2; i++) {\n                    const result = validate(instance[i], $items[i], draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, `${keywordLocation}/${i}`);\n                    evaluated[i] = true;\n                    if (!result.valid) {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'items',\n                            keywordLocation,\n                            error: `Items did not match schema.`\n                        }, ...result.errors);\n                        if (stop)\n                            break;\n                    }\n                }\n            }\n            else {\n                for (; i < length; i++) {\n                    const result = validate(instance[i], $items, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, keywordLocation);\n                    evaluated[i] = true;\n                    if (!result.valid) {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'items',\n                            keywordLocation,\n                            error: `Items did not match schema.`\n                        }, ...result.errors);\n                        if (stop)\n                            break;\n                    }\n                }\n            }\n            if (!stop && $additionalItems !== undefined) {\n                const keywordLocation = `${schemaLocation}/additionalItems`;\n                for (; i < length; i++) {\n                    const result = validate(instance[i], $additionalItems, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, keywordLocation);\n                    evaluated[i] = true;\n                    if (!result.valid) {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'additionalItems',\n                            keywordLocation,\n                            error: `Items did not match additional items schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n        if ($contains !== undefined) {\n            if (length === 0 && $minContains === undefined) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'contains',\n                    keywordLocation: `${schemaLocation}/contains`,\n                    error: `Array is empty. It must contain at least one item matching the schema.`\n                });\n            }\n            else if ($minContains !== undefined && length < $minContains) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'minContains',\n                    keywordLocation: `${schemaLocation}/minContains`,\n                    error: `Array has less items (${length}) than minContains (${$minContains}).`\n                });\n            }\n            else {\n                const keywordLocation = `${schemaLocation}/contains`;\n                const errorsLength = errors.length;\n                let contained = 0;\n                for (let j = 0; j < length; j++) {\n                    const result = validate(instance[j], $contains, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${j}`, keywordLocation);\n                    if (result.valid) {\n                        evaluated[j] = true;\n                        contained++;\n                    }\n                    else {\n                        errors.push(...result.errors);\n                    }\n                }\n                if (contained >= ($minContains || 0)) {\n                    errors.length = errorsLength;\n                }\n                if ($minContains === undefined &&\n                    $maxContains === undefined &&\n                    contained === 0) {\n                    errors.splice(errorsLength, 0, {\n                        instanceLocation,\n                        keyword: 'contains',\n                        keywordLocation,\n                        error: `Array does not contain item matching schema.`\n                    });\n                }\n                else if ($minContains !== undefined && contained < $minContains) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'minContains',\n                        keywordLocation: `${schemaLocation}/minContains`,\n                        error: `Array must contain at least ${$minContains} items matching schema. Only ${contained} items were found.`\n                    });\n                }\n                else if ($maxContains !== undefined && contained > $maxContains) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'maxContains',\n                        keywordLocation: `${schemaLocation}/maxContains`,\n                        error: `Array may contain at most ${$maxContains} items matching schema. ${contained} items were found.`\n                    });\n                }\n            }\n        }\n        if (!stop && $unevaluatedItems !== undefined) {\n            const keywordLocation = `${schemaLocation}/unevaluatedItems`;\n            for (i; i < length; i++) {\n                if (evaluated[i]) {\n                    continue;\n                }\n                const result = validate(instance[i], $unevaluatedItems, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, keywordLocation);\n                evaluated[i] = true;\n                if (!result.valid) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'unevaluatedItems',\n                        keywordLocation,\n                        error: `Items did not match unevaluated items schema.`\n                    }, ...result.errors);\n                }\n            }\n        }\n        if ($uniqueItems) {\n            for (let j = 0; j < length; j++) {\n                const a = instance[j];\n                const ao = typeof a === 'object' && a !== null;\n                for (let k = 0; k < length; k++) {\n                    if (j === k) {\n                        continue;\n                    }\n                    const b = instance[k];\n                    const bo = typeof b === 'object' && b !== null;\n                    if (a === b || (ao && bo && deepCompareStrict(a, b))) {\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'uniqueItems',\n                            keywordLocation: `${schemaLocation}/uniqueItems`,\n                            error: `Duplicate items at indexes ${j} and ${k}.`\n                        });\n                        j = Number.MAX_SAFE_INTEGER;\n                        k = Number.MAX_SAFE_INTEGER;\n                    }\n                }\n            }\n        }\n    }\n    else if (instanceType === 'number') {\n        if (draft === '4') {\n            if ($minimum !== undefined &&\n                (($exclusiveMinimum === true && instance <= $minimum) ||\n                    instance < $minimum)) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'minimum',\n                    keywordLocation: `${schemaLocation}/minimum`,\n                    error: `${instance} is less than ${$exclusiveMinimum ? 'or equal to ' : ''} ${$minimum}.`\n                });\n            }\n            if ($maximum !== undefined &&\n                (($exclusiveMaximum === true && instance >= $maximum) ||\n                    instance > $maximum)) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'maximum',\n                    keywordLocation: `${schemaLocation}/maximum`,\n                    error: `${instance} is greater than ${$exclusiveMaximum ? 'or equal to ' : ''} ${$maximum}.`\n                });\n            }\n        }\n        else {\n            if ($minimum !== undefined && instance < $minimum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'minimum',\n                    keywordLocation: `${schemaLocation}/minimum`,\n                    error: `${instance} is less than ${$minimum}.`\n                });\n            }\n            if ($maximum !== undefined && instance > $maximum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'maximum',\n                    keywordLocation: `${schemaLocation}/maximum`,\n                    error: `${instance} is greater than ${$maximum}.`\n                });\n            }\n            if ($exclusiveMinimum !== undefined && instance <= $exclusiveMinimum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'exclusiveMinimum',\n                    keywordLocation: `${schemaLocation}/exclusiveMinimum`,\n                    error: `${instance} is less than ${$exclusiveMinimum}.`\n                });\n            }\n            if ($exclusiveMaximum !== undefined && instance >= $exclusiveMaximum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'exclusiveMaximum',\n                    keywordLocation: `${schemaLocation}/exclusiveMaximum`,\n                    error: `${instance} is greater than or equal to ${$exclusiveMaximum}.`\n                });\n            }\n        }\n        if ($multipleOf !== undefined) {\n            const remainder = instance % $multipleOf;\n            if (Math.abs(0 - remainder) >= 1.1920929e-7 &&\n                Math.abs($multipleOf - remainder) >= 1.1920929e-7) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'multipleOf',\n                    keywordLocation: `${schemaLocation}/multipleOf`,\n                    error: `${instance} is not a multiple of ${$multipleOf}.`\n                });\n            }\n        }\n    }\n    else if (instanceType === 'string') {\n        const length = $minLength === undefined && $maxLength === undefined\n            ? 0\n            : ucs2length(instance);\n        if ($minLength !== undefined && length < $minLength) {\n            errors.push({\n                instanceLocation,\n                keyword: 'minLength',\n                keywordLocation: `${schemaLocation}/minLength`,\n                error: `String is too short (${length} < ${$minLength}).`\n            });\n        }\n        if ($maxLength !== undefined && length > $maxLength) {\n            errors.push({\n                instanceLocation,\n                keyword: 'maxLength',\n                keywordLocation: `${schemaLocation}/maxLength`,\n                error: `String is too long (${length} > ${$maxLength}).`\n            });\n        }\n        if ($pattern !== undefined && !new RegExp($pattern, 'u').test(instance)) {\n            errors.push({\n                instanceLocation,\n                keyword: 'pattern',\n                keywordLocation: `${schemaLocation}/pattern`,\n                error: `String does not match pattern.`\n            });\n        }\n        if ($format !== undefined &&\n            format[$format] &&\n            !format[$format](instance)) {\n            errors.push({\n                instanceLocation,\n                keyword: 'format',\n                keywordLocation: `${schemaLocation}/format`,\n                error: `String does not match format \"${$format}\".`\n            });\n        }\n    }\n    return { valid: errors.length === 0, errors };\n}\n"],"names":["validate","instance","schema","draft","lookup","dereference","shortCircuit","recursiveAnchor","instanceLocation","schemaLocation","evaluated","Object","create","valid","errors","keyword","keywordLocation","error","rawInstanceType","instanceType","Array","isArray","Error","$ref","$recursiveRef","$recursiveAnchor","type","$type","const","$const","enum","$enum","required","$required","not","$not","anyOf","$anyOf","allOf","$allOf","oneOf","$oneOf","if","$if","then","$then","else","$else","format","$format","properties","$properties","patternProperties","$patternProperties","additionalProperties","$additionalProperties","unevaluatedProperties","$unevaluatedProperties","minProperties","$minProperties","maxProperties","$maxProperties","propertyNames","$propertyNames","dependentRequired","$dependentRequired","dependentSchemas","$dependentSchemas","dependencies","$dependencies","prefixItems","$prefixItems","items","$items","additionalItems","$additionalItems","unevaluatedItems","$unevaluatedItems","contains","$contains","minContains","$minContains","maxContains","$maxContains","minItems","$minItems","maxItems","$maxItems","uniqueItems","$uniqueItems","minimum","$minimum","maximum","$maximum","exclusiveMinimum","$exclusiveMinimum","exclusiveMaximum","$exclusiveMaximum","multipleOf","$multipleOf","minLength","$minLength","maxLength","$maxLength","pattern","$pattern","__absolute_ref__","__absolute_recursive_ref__","result","push","undefined","refSchema","message","keys","join","length","i","deepCompareStrict","JSON","stringify","some","value","subEvaluateds","errorsLength","anyValid","subSchema","subEvaluated","splice","allValid","matches","filter","assign","thenResult","elseResult","key","subInstancePointer","encodePointer","dependantKey","propsOrSchema","thisEvaluated","stop","regex","RegExp","test","length2","Math","min","contained","j","a","ao","k","b","Number","MAX_SAFE_INTEGER","remainder","abs","ucs2length"],"mappings":"mNAKO,SAASA,SAASC,SAAUC,OAAQC,MAAQ,UAAWC,OAASC,YAAYH,QAASI,cAAe,EAAMC,gBAAkB,KAAMC,iBAAmB,IAAKC,eAAiB,IAAKC,UAAYC,OAAOC,OAAO,OAC7M,IAAe,IAAXV,OACA,MAAO,CAAEW,OAAO,EAAMC,OAAQ,IAElC,IAAe,IAAXZ,OACA,MAAO,CACHW,OAAO,EACPC,OAAQ,CACJ,CACIN,kCACAO,QAAS,QACTC,gBAAiBR,iBACjBS,MAAO,2BAKvB,MAAMC,uBAAyBjB,SAC/B,IAAIkB,aACJ,OAAQD,iBACJ,IAAK,UACL,IAAK,SACL,IAAK,SACDC,aAAeD,gBACf,MACJ,IAAK,SAEGC,aADa,OAAblB,SACe,OAEVmB,MAAMC,QAAQpB,UACJ,QAGA,SAEnB,MACJ,QACI,MAAM,IAAIqB,MAAM,iBAAiBJ,4CAEzC,MAAMK,KAAEA,KAAIC,cAAEA,cAAaC,iBAAEA,iBAAkBC,KAAMC,MAAOC,MAAOC,OAAQC,KAAMC,MAAOC,SAAUC,UAAWC,IAAKC,KAAMC,MAAOC,OAAQC,MAAOC,OAAQC,MAAOC,OAAQC,GAAIC,IAAKC,KAAMC,MAAOC,KAAMC,MAAOC,OAAQC,QAASC,WAAYC,YAAaC,kBAAmBC,mBAAoBC,qBAAsBC,sBAAuBC,sBAAuBC,uBAAwBC,cAAeC,eAAgBC,cAAeC,eAAgBC,cAAeC,eAAgBC,kBAAmBC,mBAAoBC,iBAAkBC,kBAAmBC,aAAcC,cAAeC,YAAaC,aAAcC,MAAOC,OAAQC,gBAAiBC,iBAAkBC,iBAAkBC,kBAAmBC,SAAUC,UAAWC,YAAaC,aAAcC,YAAaC,aAAcC,SAAUC,UAAWC,SAAUC,UAAWC,YAAaC,aAAcC,QAASC,SAAUC,QAASC,SAAUC,iBAAkBC,kBAAmBC,iBAAkBC,kBAAmBC,WAAYC,YAAaC,UAAWC,WAAYC,UAAWC,WAAYC,QAASC,SAAQC,iBAAEA,iBAAgBC,2BAAEA,4BAA+BzG,OACljCY,OAAS,GAIf,IAHyB,IAArBW,kBAAiD,OAApBlB,kBAC7BA,gBAAkBL,QAEA,MAAlBsB,cAAuB,CACvB,MAGMR,gBAAkB,GAAGP,+BACrBmG,OAAS5G,SAASC,SAA8B,OAApBM,gBAA2BL,OAASK,gBAAiBJ,MAAOC,OAAQE,aAJhE,OAApBC,gBACZH,OAAOuG,4BACPpG,gBAEyHC,iBAAkBQ,gBAAiBN,WAC7JkG,OAAO/F,OACRC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,gBACTC,gCACAC,MAAO,8BACL2F,OAAO9F,OAErB,CACA,QAAagG,IAATvF,KAAoB,CACpB,MACMwF,UAAY3G,OADNsG,kBAAoBnF,MAEhC,QAAkBuF,IAAdC,UAAyB,CACzB,IAAIC,QAAU,oBAAoBzF,SAKlC,MAJImF,kBAAoBA,mBAAqBnF,OACzCyF,SAAW,mBAAmBN,sBAElCM,SAAW,uBAAuBrG,OAAOsG,KAAK7G,QAAQ8G,KAAK,UACrD,IAAI5F,MAAM0F,QACpB,CACA,MAAMhG,gBAAkB,GAAGP,sBACrBmG,OAAS5G,SAASC,SAAU8G,UAAW5G,MAAOC,OAAQE,aAAcC,gBAAiBC,iBAAkBQ,gBAAiBN,WAS9H,GARKkG,OAAO/F,OACRC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,OACTC,gCACAC,MAAO,8BACL2F,OAAO9F,QAEH,MAAVX,OAA2B,MAAVA,MACjB,MAAO,CAAEU,MAAyB,IAAlBC,OAAOqG,OAAcrG,cAE7C,CACA,GAAIM,MAAMC,QAAQM,OAAQ,CACtB,IAAIwF,OAASxF,MAAMwF,OACftG,OAAQ,EACZ,IAAK,IAAIuG,EAAI,EAAGA,EAAID,OAAQC,IACxB,GAAIjG,eAAiBQ,MAAMyF,IACT,YAAbzF,MAAMyF,IACc,WAAjBjG,cACAlB,SAAW,GAAM,GACjBA,UAAaA,SAAW,CAC5BY,OAAQ,EACR,KACJ,CAECA,OACDC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,OACTC,gBAAiB,GAAGP,sBACpBQ,MAAO,kBAAkBE,uCAAuCQ,MAAMuF,KAAK,aAGvF,KACmB,YAAVvF,OACgB,WAAjBR,cAA6BlB,SAAW,GAAKA,UAAaA,WAC1Da,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,OACTC,gBAAiB,GAAGP,sBACpBQ,MAAO,kBAAkBE,uCAAuCQ,iBAIzDmF,IAAVnF,OAAuBR,eAAiBQ,OAC7Cb,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,OACTC,gBAAiB,GAAGP,sBACpBQ,MAAO,kBAAkBE,uCAAuCQ,YA2CxE,QAxCemF,IAAXjF,SACqB,WAAjBV,cAA8C,UAAjBA,aACxBkG,kBAAkBpH,SAAU4B,SAC7Bf,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,QACTC,gBAAiB,GAAGP,uBACpBQ,MAAO,2BAA2BqG,KAAKC,UAAU1F,aAIpD5B,WAAa4B,QAClBf,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,QACTC,gBAAiB,GAAGP,uBACpBQ,MAAO,2BAA2BqG,KAAKC,UAAU1F,mBAI/CiF,IAAV/E,QACqB,WAAjBZ,cAA8C,UAAjBA,aACxBY,MAAMyF,KAAKC,OAASJ,kBAAkBpH,SAAUwH,SACjD3G,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,OACTC,gBAAiB,GAAGP,sBACpBQ,MAAO,kCAAkCqG,KAAKC,UAAUxF,YAI1DA,MAAMyF,KAAKC,OAASxH,WAAawH,QACvC3G,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,OACTC,gBAAiB,GAAGP,sBACpBQ,MAAO,kCAAkCqG,KAAKC,UAAUxF,kBAIvD+E,IAAT3E,KAAoB,CACpB,MAAMnB,gBAAkB,GAAGP,qBACZT,SAASC,SAAUkC,KAAMhC,MAAOC,OAAQE,aAAcC,gBAAiBC,iBAAkBQ,iBAC7FH,OACPC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,MACTC,gCACAC,MAAO,kCAGnB,CACA,IAAIyG,cAAgB,GACpB,QAAeZ,IAAXzE,OAAsB,CACtB,MAAMrB,gBAAkB,GAAGP,uBACrBkH,aAAe7G,OAAOqG,OAC5B,IAAIS,UAAW,EACf,IAAK,IAAIR,EAAI,EAAGA,EAAI/E,OAAO8E,OAAQC,IAAK,CACpC,MAAMS,UAAYxF,OAAO+E,GACnBU,aAAenH,OAAOC,OAAOF,WAC7BkG,OAAS5G,SAASC,SAAU4H,UAAW1H,MAAOC,OAAQE,cAAmC,IAArBmB,iBAA4BlB,gBAAkB,KAAMC,iBAAkB,GAAGQ,mBAAmBoG,IAAKU,cAC3KhH,OAAO+F,QAAQD,OAAO9F,QACtB8G,SAAWA,UAAYhB,OAAO/F,MAC1B+F,OAAO/F,OACP6G,cAAcb,KAAKiB,aAE3B,CACIF,SACA9G,OAAOqG,OAASQ,aAGhB7G,OAAOiH,OAAOJ,aAAc,EAAG,CAC3BnH,kCACAO,QAAS,QACTC,gCACAC,MAAO,2CAGnB,CACA,QAAe6F,IAAXvE,OAAsB,CACtB,MAAMvB,gBAAkB,GAAGP,uBACrBkH,aAAe7G,OAAOqG,OAC5B,IAAIa,UAAW,EACf,IAAK,IAAIZ,EAAI,EAAGA,EAAI7E,OAAO4E,OAAQC,IAAK,CACpC,MAAMS,UAAYtF,OAAO6E,GACnBU,aAAenH,OAAOC,OAAOF,WAC7BkG,OAAS5G,SAASC,SAAU4H,UAAW1H,MAAOC,OAAQE,cAAmC,IAArBmB,iBAA4BlB,gBAAkB,KAAMC,iBAAkB,GAAGQ,mBAAmBoG,IAAKU,cAC3KhH,OAAO+F,QAAQD,OAAO9F,QACtBkH,SAAWA,UAAYpB,OAAO/F,MAC1B+F,OAAO/F,OACP6G,cAAcb,KAAKiB,aAE3B,CACIE,SACAlH,OAAOqG,OAASQ,aAGhB7G,OAAOiH,OAAOJ,aAAc,EAAG,CAC3BnH,kCACAO,QAAS,QACTC,gCACAC,MAAO,4CAGnB,CACA,QAAe6F,IAAXrE,OAAsB,CACtB,MAAMzB,gBAAkB,GAAGP,uBACrBkH,aAAe7G,OAAOqG,OACtBc,QAAUxF,OAAOyF,OAAO,CAACL,UAAWT,KACtC,MAAMU,aAAenH,OAAOC,OAAOF,WAC7BkG,OAAS5G,SAASC,SAAU4H,UAAW1H,MAAOC,OAAQE,cAAmC,IAArBmB,iBAA4BlB,gBAAkB,KAAMC,iBAAkB,GAAGQ,mBAAmBoG,IAAKU,cAK3K,OAJAhH,OAAO+F,QAAQD,OAAO9F,QAClB8F,OAAO/F,OACP6G,cAAcb,KAAKiB,cAEhBlB,OAAO/F,QACfsG,OACa,IAAZc,QACAnH,OAAOqG,OAASQ,aAGhB7G,OAAOiH,OAAOJ,aAAc,EAAG,CAC3BnH,kCACAO,QAAS,QACTC,gCACAC,MAAO,kDAAkDgH,qBAGrE,CAIA,GAHqB,WAAjB9G,cAA8C,UAAjBA,cAC7BR,OAAOwH,OAAOzH,aAAcgH,oBAEpBZ,IAARnE,IAAmB,CACnB,MAAM3B,gBAAkB,GAAGP,oBAE3B,GADwBT,SAASC,SAAU0C,IAAKxC,MAAOC,OAAQE,aAAcC,gBAAiBC,iBAAkBQ,gBAAiBN,WAAWG,OAExI,QAAciG,IAAVjE,MAAqB,CACrB,MAAMuF,WAAapI,SAASC,SAAU4C,MAAO1C,MAAOC,OAAQE,aAAcC,gBAAiBC,iBAAkB,GAAGC,sBAAuBC,WAClI0H,WAAWvH,OACZC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,KACTC,gCACAC,MAAO,6CACLmH,WAAWtH,OAEzB,OAEC,QAAcgG,IAAV/D,MAAqB,CAC1B,MAAMsF,WAAarI,SAASC,SAAU8C,MAAO5C,MAAOC,OAAQE,aAAcC,gBAAiBC,iBAAkB,GAAGC,sBAAuBC,WAClI2H,WAAWxH,OACZC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,KACTC,gCACAC,MAAO,6CACLoH,WAAWvH,OAEzB,CACJ,CACA,GAAqB,WAAjBK,aAA2B,CAC3B,QAAkB2F,IAAd7E,UACA,IAAK,MAAMqG,OAAOrG,UACRqG,OAAOrI,UACTa,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,WACTC,gBAAiB,GAAGP,0BACpBQ,MAAO,6CAA6CqH,UAKpE,MAAMrB,KAAOtG,OAAOsG,KAAKhH,UAiBzB,QAhBuB6G,IAAnBnD,gBAAgCsD,KAAKE,OAASxD,gBAC9C7C,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,gBACTC,gBAAiB,GAAGP,+BACpBQ,MAAO,mCAAmC0C,oCAG3BmD,IAAnBjD,gBAAgCoD,KAAKE,OAAStD,gBAC9C/C,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,gBACTC,gBAAiB,GAAGP,+BACpBQ,MAAO,mCAAmC4C,oCAG3BiD,IAAnB/C,eAA8B,CAC9B,MAAM/C,gBAAkB,GAAGP,+BAC3B,IAAK,MAAM6H,OAAOrI,SAAU,CACxB,MAAMsI,mBAAqB,GAAG/H,oBAAoBgI,cAAcF,OAC1D1B,OAAS5G,SAASsI,IAAKvE,eAAgB5D,MAAOC,OAAQE,aAAcC,gBAAiBgI,mBAAoBvH,iBAC1G4F,OAAO/F,OACRC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,gBACTC,gCACAC,MAAO,kBAAkBqH,kCACvB1B,OAAO9F,OAErB,CACJ,CACA,QAA2BgG,IAAvB7C,mBAAkC,CAClC,MAAMjD,gBAAkB,GAAGP,mCAC3B,IAAK,MAAM6H,OAAOrE,mBACd,GAAIqE,OAAOrI,SAAU,CACjB,MAAM+B,SAAWiC,mBAAmBqE,KACpC,IAAK,MAAMG,gBAAgBzG,SACjByG,gBAAgBxI,UAClBa,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,oBACTC,gCACAC,MAAO,iBAAiBqH,2BAA2BG,kBAInE,CAER,CACA,QAA0B3B,IAAtB3C,kBACA,IAAK,MAAMmE,OAAOnE,kBAAmB,CACjC,MAAMnD,gBAAkB,GAAGP,kCAC3B,GAAI6H,OAAOrI,SAAU,CACjB,MAAM2G,OAAS5G,SAASC,SAAUkE,kBAAkBmE,KAAMnI,MAAOC,OAAQE,aAAcC,gBAAiBC,iBAAkB,GAAGQ,mBAAmBwH,cAAcF,OAAQ5H,WACjKkG,OAAO/F,OACRC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,mBACTC,gCACAC,MAAO,iBAAiBqH,gDACtB1B,OAAO9F,OAErB,CACJ,CAEJ,QAAsBgG,IAAlBzC,cAA6B,CAC7B,MAAMrD,gBAAkB,GAAGP,8BAC3B,IAAK,MAAM6H,OAAOjE,cACd,GAAIiE,OAAOrI,SAAU,CACjB,MAAMyI,cAAgBrE,cAAciE,KACpC,GAAIlH,MAAMC,QAAQqH,eACd,IAAK,MAAMD,gBAAgBC,cACjBD,gBAAgBxI,UAClBa,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,eACTC,gCACAC,MAAO,iBAAiBqH,2BAA2BG,uBAK9D,CACD,MAAM7B,OAAS5G,SAASC,SAAUyI,cAAevI,MAAOC,OAAQE,aAAcC,gBAAiBC,iBAAkB,GAAGQ,mBAAmBwH,cAAcF,QAChJ1B,OAAO/F,OACRC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,eACTC,gCACAC,MAAO,iBAAiBqH,gDACtB1B,OAAO9F,OAErB,CACJ,CAER,CACA,MAAM6H,cAAgBhI,OAAOC,OAAO,MACpC,IAAIgI,MAAO,EACX,QAAoB9B,IAAhB3D,YAA2B,CAC3B,MAAMnC,gBAAkB,GAAGP,4BAC3B,IAAK,MAAM6H,OAAOnF,YAAa,CAC3B,KAAMmF,OAAOrI,UACT,SAEJ,MAAMsI,mBAAqB,GAAG/H,oBAAoBgI,cAAcF,OAC1D1B,OAAS5G,SAASC,SAASqI,KAAMnF,YAAYmF,KAAMnI,MAAOC,OAAQE,aAAcC,gBAAiBgI,mBAAoB,GAAGvH,mBAAmBwH,cAAcF,QAC/J,GAAI1B,OAAO/F,MACPH,UAAU4H,KAAOK,cAAcL,MAAO,OAUtC,GAPAM,KAAOtI,aACPQ,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,aACTC,gCACAC,MAAO,aAAaqH,kCAClB1B,OAAO9F,QACT8H,KACA,KAEZ,CACJ,CACA,IAAKA,WAA+B9B,IAAvBzD,mBAAkC,CAC3C,MAAMrC,gBAAkB,GAAGP,mCAC3B,IAAK,MAAM+F,WAAWnD,mBAAoB,CACtC,MAAMwF,MAAQ,IAAIC,OAAOtC,QAAS,KAC5BqB,UAAYxE,mBAAmBmD,SACrC,IAAK,MAAM8B,OAAOrI,SAAU,CACxB,IAAK4I,MAAME,KAAKT,KACZ,SAEJ,MAAMC,mBAAqB,GAAG/H,oBAAoBgI,cAAcF,OAC1D1B,OAAS5G,SAASC,SAASqI,KAAMT,UAAW1H,MAAOC,OAAQE,aAAcC,gBAAiBgI,mBAAoB,GAAGvH,mBAAmBwH,cAAchC,YACpJI,OAAO/F,MACPH,UAAU4H,KAAOK,cAAcL,MAAO,GAGtCM,KAAOtI,aACPQ,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,oBACTC,gCACAC,MAAO,aAAaqH,yBAAyB9B,qDAC3CI,OAAO9F,QAErB,CACJ,CACJ,CACA,GAAK8H,WAAkC9B,IAA1BvD,uBAsBR,IAAKqF,WAAmC9B,IAA3BrD,uBAAsC,CACpD,MAAMzC,gBAAkB,GAAGP,uCAC3B,IAAK,MAAM6H,OAAOrI,SACd,IAAKS,UAAU4H,KAAM,CACjB,MAAMC,mBAAqB,GAAG/H,oBAAoBgI,cAAcF,OAC1D1B,OAAS5G,SAASC,SAASqI,KAAM7E,uBAAwBtD,MAAOC,OAAQE,aAAcC,gBAAiBgI,mBAAoBvH,iBAC7H4F,OAAO/F,MACPH,UAAU4H,MAAO,EAGjBxH,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,wBACTC,gCACAC,MAAO,aAAaqH,yDAClB1B,OAAO9F,OAErB,CAER,MAzCkD,CAC9C,MAAME,gBAAkB,GAAGP,sCAC3B,IAAK,MAAM6H,OAAOrI,SAAU,CACxB,GAAI0I,cAAcL,KACd,SAEJ,MAAMC,mBAAqB,GAAG/H,oBAAoBgI,cAAcF,OAC1D1B,OAAS5G,SAASC,SAASqI,KAAM/E,sBAAuBpD,MAAOC,OAAQE,aAAcC,gBAAiBgI,mBAAoBvH,iBAC5H4F,OAAO/F,MACPH,UAAU4H,MAAO,GAGjBM,KAAOtI,aACPQ,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,uBACTC,gCACAC,MAAO,aAAaqH,wDAClB1B,OAAO9F,QAErB,CACJ,CAqBJ,MACK,GAAqB,UAAjBK,aAA0B,MACb2F,IAAdvB,WAA2BtF,SAASkH,OAAS5B,WAC7CzE,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,WACTC,gBAAiB,GAAGP,0BACpBQ,MAAO,6BAA6BhB,SAASkH,YAAY5B,qBAG/CuB,IAAdzB,WAA2BpF,SAASkH,OAAS9B,WAC7CvE,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,WACTC,gBAAiB,GAAGP,0BACpBQ,MAAO,4BAA4BhB,SAASkH,YAAY9B,gBAGhE,MAAM8B,OAASlH,SAASkH,OACxB,IAAIC,EAAI,EACJwB,MAAO,EACX,QAAqB9B,IAAjBvC,aAA4B,CAC5B,MAAMvD,gBAAkB,GAAGP,6BACrBuI,QAAUC,KAAKC,IAAI3E,aAAa4C,OAAQA,QAC9C,KAAOC,EAAI4B,QAAS5B,IAAK,CACrB,MAAMR,OAAS5G,SAASC,SAASmH,GAAI7C,aAAa6C,GAAIjH,MAAOC,OAAQE,aAAcC,gBAAiB,GAAGC,oBAAoB4G,IAAK,GAAGpG,mBAAmBoG,KAEtJ,GADA1G,UAAU0G,IAAK,GACVR,OAAO/F,QACR+H,KAAOtI,aACPQ,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,cACTC,gCACAC,MAAO,kCACL2F,OAAO9F,QACT8H,MACA,KAEZ,CACJ,CACA,QAAe9B,IAAXrC,OAAsB,CACtB,MAAMzD,gBAAkB,GAAGP,uBAC3B,GAAIW,MAAMC,QAAQoD,QAAS,CACvB,MAAMuE,QAAUC,KAAKC,IAAIzE,OAAO0C,OAAQA,QACxC,KAAOC,EAAI4B,QAAS5B,IAAK,CACrB,MAAMR,OAAS5G,SAASC,SAASmH,GAAI3C,OAAO2C,GAAIjH,MAAOC,OAAQE,aAAcC,gBAAiB,GAAGC,oBAAoB4G,IAAK,GAAGpG,mBAAmBoG,KAEhJ,GADA1G,UAAU0G,IAAK,GACVR,OAAO/F,QACR+H,KAAOtI,aACPQ,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,QACTC,gCACAC,MAAO,kCACL2F,OAAO9F,QACT8H,MACA,KAEZ,CACJ,MAEI,KAAOxB,EAAID,OAAQC,IAAK,CACpB,MAAMR,OAAS5G,SAASC,SAASmH,GAAI3C,OAAQtE,MAAOC,OAAQE,aAAcC,gBAAiB,GAAGC,oBAAoB4G,IAAKpG,iBAEvH,GADAN,UAAU0G,IAAK,GACVR,OAAO/F,QACR+H,KAAOtI,aACPQ,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,QACTC,gCACAC,MAAO,kCACL2F,OAAO9F,QACT8H,MACA,KAEZ,CAEJ,IAAKA,WAA6B9B,IAArBnC,iBAAgC,CACzC,MAAM3D,gBAAkB,GAAGP,iCAC3B,KAAO2G,EAAID,OAAQC,IAAK,CACpB,MAAMR,OAAS5G,SAASC,SAASmH,GAAIzC,iBAAkBxE,MAAOC,OAAQE,aAAcC,gBAAiB,GAAGC,oBAAoB4G,IAAKpG,iBACjIN,UAAU0G,IAAK,EACVR,OAAO/F,QACR+H,KAAOtI,aACPQ,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,kBACTC,gCACAC,MAAO,mDACL2F,OAAO9F,QAErB,CACJ,CACJ,CACA,QAAkBgG,IAAd/B,UACA,GAAe,IAAXoC,aAAiCL,IAAjB7B,aAChBnE,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,WACTC,gBAAiB,GAAGP,0BACpBQ,MAAO,gFAGV,QAAqB6F,IAAjB7B,cAA8BkC,OAASlC,aAC5CnE,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,cACTC,gBAAiB,GAAGP,6BACpBQ,MAAO,yBAAyBkG,6BAA6BlC,uBAGhE,CACD,MAAMjE,gBAAkB,GAAGP,0BACrBkH,aAAe7G,OAAOqG,OAC5B,IAAIgC,UAAY,EAChB,IAAK,IAAIC,EAAI,EAAGA,EAAIjC,OAAQiC,IAAK,CAC7B,MAAMxC,OAAS5G,SAASC,SAASmJ,GAAIrE,UAAW5E,MAAOC,OAAQE,aAAcC,gBAAiB,GAAGC,oBAAoB4I,IAAKpI,iBACtH4F,OAAO/F,OACPH,UAAU0I,IAAK,EACfD,aAGArI,OAAO+F,QAAQD,OAAO9F,OAE9B,CACIqI,YAAclE,cAAgB,KAC9BnE,OAAOqG,OAASQ,mBAECb,IAAjB7B,mBACiB6B,IAAjB3B,cACc,IAAdgE,UACArI,OAAOiH,OAAOJ,aAAc,EAAG,CAC3BnH,kCACAO,QAAS,WACTC,gCACAC,MAAO,sDAGW6F,IAAjB7B,cAA8BkE,UAAYlE,aAC/CnE,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,cACTC,gBAAiB,GAAGP,6BACpBQ,MAAO,+BAA+BgE,4CAA4CkE,qCAGhErC,IAAjB3B,cAA8BgE,UAAYhE,cAC/CrE,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,cACTC,gBAAiB,GAAGP,6BACpBQ,MAAO,6BAA6BkE,uCAAuCgE,+BAGvF,CAEJ,IAAKP,WAA8B9B,IAAtBjC,kBAAiC,CAC1C,MAAM7D,gBAAkB,GAAGP,kCAC3B,KAAQ2G,EAAID,OAAQC,IAAK,CACrB,GAAI1G,UAAU0G,GACV,SAEJ,MAAMR,OAAS5G,SAASC,SAASmH,GAAIvC,kBAAmB1E,MAAOC,OAAQE,aAAcC,gBAAiB,GAAGC,oBAAoB4G,IAAKpG,iBAClIN,UAAU0G,IAAK,EACVR,OAAO/F,OACRC,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,mBACTC,gCACAC,MAAO,oDACL2F,OAAO9F,OAErB,CACJ,CACA,GAAI2E,aACA,IAAK,IAAI2D,EAAI,EAAGA,EAAIjC,OAAQiC,IAAK,CAC7B,MAAMC,EAAIpJ,SAASmJ,GACbE,GAAkB,iBAAND,GAAwB,OAANA,EACpC,IAAK,IAAIE,EAAI,EAAGA,EAAIpC,OAAQoC,IAAK,CAC7B,GAAIH,IAAMG,EACN,SAEJ,MAAMC,EAAIvJ,SAASsJ,IAEfF,IAAMG,GAAMF,IADQ,iBAANE,GAAwB,OAANA,GACRnC,kBAAkBgC,EAAGG,MAC7C1I,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,cACTC,gBAAiB,GAAGP,6BACpBQ,MAAO,8BAA8BmI,SAASG,OAElDH,EAAIK,OAAOC,iBACXH,EAAIE,OAAOC,iBAEnB,CACJ,CAER,MACK,GAAqB,WAAjBvI,cAyDL,GAxDc,MAAVhB,YACiB2G,IAAbnB,YACwB,IAAtBI,mBAA8B9F,UAAY0F,UACxC1F,SAAW0F,WACf7E,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,UACTC,gBAAiB,GAAGP,yBACpBQ,MAAO,GAAGhB,yBAAyB8F,kBAAoB,eAAiB,MAAMJ,mBAGrEmB,IAAbjB,YACwB,IAAtBI,mBAA8BhG,UAAY4F,UACxC5F,SAAW4F,WACf/E,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,UACTC,gBAAiB,GAAGP,yBACpBQ,MAAO,GAAGhB,4BAA4BgG,kBAAoB,eAAiB,MAAMJ,qBAKxEiB,IAAbnB,UAA0B1F,SAAW0F,UACrC7E,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,UACTC,gBAAiB,GAAGP,yBACpBQ,MAAO,GAAGhB,yBAAyB0F,mBAG1BmB,IAAbjB,UAA0B5F,SAAW4F,UACrC/E,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,UACTC,gBAAiB,GAAGP,yBACpBQ,MAAO,GAAGhB,4BAA4B4F,mBAGpBiB,IAAtBf,mBAAmC9F,UAAY8F,mBAC/CjF,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,mBACTC,gBAAiB,GAAGP,kCACpBQ,MAAO,GAAGhB,yBAAyB8F,4BAGjBe,IAAtBb,mBAAmChG,UAAYgG,mBAC/CnF,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,mBACTC,gBAAiB,GAAGP,kCACpBQ,MAAO,GAAGhB,wCAAwCgG,6BAI1Ca,IAAhBX,YAA2B,CAC3B,MAAMwD,UAAY1J,SAAWkG,YACzB8C,KAAKW,IAAI,EAAID,YAAc,cAC3BV,KAAKW,IAAIzD,YAAcwD,YAAc,cACrC7I,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,aACTC,gBAAiB,GAAGP,4BACpBQ,MAAO,GAAGhB,iCAAiCkG,gBAGvD,OAEC,GAAqB,WAAjBhF,aAA2B,CAChC,MAAMgG,YAAwBL,IAAfT,iBAA2CS,IAAfP,WACrC,EACAsD,WAAW5J,eACE6G,IAAfT,YAA4Bc,OAASd,YACrCvF,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,YACTC,gBAAiB,GAAGP,2BACpBQ,MAAO,wBAAwBkG,YAAYd,sBAGhCS,IAAfP,YAA4BY,OAASZ,YACrCzF,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,YACTC,gBAAiB,GAAGP,2BACpBQ,MAAO,uBAAuBkG,YAAYZ,sBAGjCO,IAAbL,UAA2B,IAAIqC,OAAOrC,SAAU,KAAKsC,KAAK9I,WAC1Da,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,UACTC,gBAAiB,GAAGP,yBACpBQ,MAAO,wCAGC6F,IAAZ7D,SACAD,OAAOC,WACND,OAAOC,SAAShD,WACjBa,OAAO+F,KAAK,CACRrG,kCACAO,QAAS,SACTC,gBAAiB,GAAGP,wBACpBQ,MAAO,iCAAiCgC,aAGpD,CACA,MAAO,CAAEpC,MAAyB,IAAlBC,OAAOqG,OAAcrG,cACzC","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@cfworker/json-schema/dist/esm/validator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"validator.js","sources":["../../../../../../../../../../../../../node_modules/@cfworker/json-schema/dist/esm/validator.js"],"sourcesContent":["import { dereference } from './dereference.js';\nimport { validate } from './validate.js';\nexport class Validator {\n    schema;\n    draft;\n    shortCircuit;\n    lookup;\n    constructor(schema, draft = '2019-09', shortCircuit = true) {\n        this.schema = schema;\n        this.draft = draft;\n        this.shortCircuit = shortCircuit;\n        this.lookup = dereference(schema);\n    }\n    validate(instance) {\n        return validate(instance, this.schema, this.draft, this.lookup, this.shortCircuit);\n    }\n    addSchema(schema, id) {\n        if (id) {\n            schema = { ...schema, $id: id };\n        }\n        dereference(schema, this.lookup);\n    }\n}\n"],"names":["Validator","schema","draft","shortCircuit","lookup","constructor","this","dereference","validate","instance","addSchema","id","$id"],"mappings":"8EAEO,MAAMA,UACTC,OACAC,MACAC,aACAC,OACA,WAAAC,CAAYJ,OAAQC,MAAQ,UAAWC,cAAe,GAClDG,KAAKL,OAASA,OACdK,KAAKJ,MAAQA,MACbI,KAAKH,aAAeA,aACpBG,KAAKF,OAASG,YAAYN,OAC9B,CACA,QAAAO,CAASC,UACL,OAAOD,SAASC,SAAUH,KAAKL,OAAQK,KAAKJ,MAAOI,KAAKF,OAAQE,KAAKH,aACzE,CACA,SAAAO,CAAUT,OAAQU,IACVA,KACAV,OAAS,IAAKA,OAAQW,IAAKD,KAE/BJ,YAAYN,OAAQK,KAAKF,OAC7B","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@dimforge/rapier3d/coarena.js

@@ -1,2 +0,0 @@
-class Coarena{constructor(){this.fconv=new Float64Array(1),this.uconv=new Uint32Array(this.fconv.buffer),this.data=new Array,this.size=0}set(handle,data){let i=this.index(handle);for(;this.data.length<=i;)this.data.push(null);null==this.data[i]&&(this.size+=1),this.data[i]=data}len(){return this.size}delete(handle){let i=this.index(handle);i<this.data.length&&(null!=this.data[i]&&(this.size-=1),this.data[i]=null)}clear(){this.data=new Array}get(handle){let i=this.index(handle);return i<this.data.length?this.data[i]:null}forEach(f){for(const elt of this.data)null!=elt&&f(elt)}getAll(){return this.data.filter(elt=>null!=elt)}index(handle){return this.fconv[0]=handle,this.uconv[0]}}export{Coarena};
-//# sourceMappingURL=coarena.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@dimforge/rapier3d/coarena.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"coarena.js","sources":["../../../../../../../../../../../node_modules/@dimforge/rapier3d/coarena.js"],"sourcesContent":["export class Coarena {\n    constructor() {\n        this.fconv = new Float64Array(1);\n        this.uconv = new Uint32Array(this.fconv.buffer);\n        this.data = new Array();\n        this.size = 0;\n    }\n    set(handle, data) {\n        let i = this.index(handle);\n        while (this.data.length <= i) {\n            this.data.push(null);\n        }\n        if (this.data[i] == null)\n            this.size += 1;\n        this.data[i] = data;\n    }\n    len() {\n        return this.size;\n    }\n    delete(handle) {\n        let i = this.index(handle);\n        if (i < this.data.length) {\n            if (this.data[i] != null)\n                this.size -= 1;\n            this.data[i] = null;\n        }\n    }\n    clear() {\n        this.data = new Array();\n    }\n    get(handle) {\n        let i = this.index(handle);\n        if (i < this.data.length) {\n            return this.data[i];\n        }\n        else {\n            return null;\n        }\n    }\n    forEach(f) {\n        for (const elt of this.data) {\n            if (elt != null)\n                f(elt);\n        }\n    }\n    getAll() {\n        return this.data.filter((elt) => elt != null);\n    }\n    index(handle) {\n        /// Extracts the index part of a handle (the lower 32 bits).\n        /// This is done by first injecting the handle into an Float64Array\n        /// which is itself injected into an Uint32Array (at construction time).\n        /// The 0-th value of the Uint32Array will become the `number` integer\n        /// representation of the lower 32 bits.\n        /// Also `this.uconv[1]` then contains the generation number as a `number`,\n        /// which we don’t really need.\n        this.fconv[0] = handle;\n        return this.uconv[0];\n    }\n}\n//# sourceMappingURL=coarena.js.map"],"names":["Coarena","constructor","this","fconv","Float64Array","uconv","Uint32Array","buffer","data","Array","size","set","handle","i","index","length","push","len","clear","get","forEach","f","elt","getAll","filter"],"mappings":"AAAO,MAAMA,QACT,WAAAC,GACIC,KAAKC,MAAQ,IAAIC,aAAa,GAC9BF,KAAKG,MAAQ,IAAIC,YAAYJ,KAAKC,MAAMI,QACxCL,KAAKM,KAAO,IAAIC,MAChBP,KAAKQ,KAAO,CAChB,CACA,GAAAC,CAAIC,OAAQJ,MACR,IAAIK,EAAIX,KAAKY,MAAMF,QACnB,KAAOV,KAAKM,KAAKO,QAAUF,GACvBX,KAAKM,KAAKQ,KAAK,MAEC,MAAhBd,KAAKM,KAAKK,KACVX,KAAKQ,MAAQ,GACjBR,KAAKM,KAAKK,GAAKL,IACnB,CACA,GAAAS,GACI,OAAOf,KAAKQ,IAChB,CACA,OAAOE,QACH,IAAIC,EAAIX,KAAKY,MAAMF,QACfC,EAAIX,KAAKM,KAAKO,SACM,MAAhBb,KAAKM,KAAKK,KACVX,KAAKQ,MAAQ,GACjBR,KAAKM,KAAKK,GAAK,KAEvB,CACA,KAAAK,GACIhB,KAAKM,KAAO,IAAIC,KACpB,CACA,GAAAU,CAAIP,QACA,IAAIC,EAAIX,KAAKY,MAAMF,QACnB,OAAIC,EAAIX,KAAKM,KAAKO,OACPb,KAAKM,KAAKK,GAGV,IAEf,CACA,OAAAO,CAAQC,GACJ,IAAK,MAAMC,OAAOpB,KAAKM,KACR,MAAPc,KACAD,EAAEC,IAEd,CACA,MAAAC,GACI,OAAOrB,KAAKM,KAAKgB,OAAQF,KAAe,MAAPA,IACrC,CACA,KAAAR,CAAMF,QASF,OADAV,KAAKC,MAAM,GAAKS,OACTV,KAAKG,MAAM,EACtB","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@dimforge/rapier3d/control/character_controller.js

@@ -1,2 +0,0 @@
-import"../rapier_wasm3d.js";import{VectorOps}from"../math.js";import{RawKinematicCharacterController,RawCharacterCollision}from"../rapier_wasm3d_bg.js";class CharacterCollision{}class KinematicCharacterController{constructor(offset,params,broadPhase,narrowPhase,bodies,colliders){this.params=params,this.bodies=bodies,this.colliders=colliders,this.broadPhase=broadPhase,this.narrowPhase=narrowPhase,this.raw=new RawKinematicCharacterController(offset),this.rawCharacterCollision=new RawCharacterCollision,this._applyImpulsesToDynamicBodies=!1,this._characterMass=null}free(){this.raw&&(this.raw.free(),this.rawCharacterCollision.free()),this.raw=void 0,this.rawCharacterCollision=void 0}up(){return this.raw.up()}setUp(vector){let rawVect=VectorOps.intoRaw(vector);return this.raw.setUp(rawVect)}applyImpulsesToDynamicBodies(){return this._applyImpulsesToDynamicBodies}setApplyImpulsesToDynamicBodies(enabled){this._applyImpulsesToDynamicBodies=enabled}characterMass(){return this._characterMass}setCharacterMass(mass){this._characterMass=mass}offset(){return this.raw.offset()}setOffset(value){this.raw.setOffset(value)}normalNudgeFactor(){return this.raw.normalNudgeFactor()}setNormalNudgeFactor(value){this.raw.setNormalNudgeFactor(value)}slideEnabled(){return this.raw.slideEnabled()}setSlideEnabled(enabled){this.raw.setSlideEnabled(enabled)}autostepMaxHeight(){return this.raw.autostepMaxHeight()}autostepMinWidth(){return this.raw.autostepMinWidth()}autostepIncludesDynamicBodies(){return this.raw.autostepIncludesDynamicBodies()}autostepEnabled(){return this.raw.autostepEnabled()}enableAutostep(maxHeight,minWidth,includeDynamicBodies){this.raw.enableAutostep(maxHeight,minWidth,includeDynamicBodies)}disableAutostep(){return this.raw.disableAutostep()}maxSlopeClimbAngle(){return this.raw.maxSlopeClimbAngle()}setMaxSlopeClimbAngle(angle){this.raw.setMaxSlopeClimbAngle(angle)}minSlopeSlideAngle(){return this.raw.minSlopeSlideAngle()}setMinSlopeSlideAngle(angle){this.raw.setMinSlopeSlideAngle(angle)}snapToGroundDistance(){return this.raw.snapToGroundDistance()}enableSnapToGround(distance){this.raw.enableSnapToGround(distance)}disableSnapToGround(){this.raw.disableSnapToGround()}snapToGroundEnabled(){return this.raw.snapToGroundEnabled()}computeColliderMovement(collider,desiredTranslationDelta,filterFlags,filterGroups,filterPredicate){let rawTranslationDelta=VectorOps.intoRaw(desiredTranslationDelta);this.raw.computeColliderMovement(this.params.dt,this.broadPhase.raw,this.narrowPhase.raw,this.bodies.raw,this.colliders.raw,collider.handle,rawTranslationDelta,this._applyImpulsesToDynamicBodies,this._characterMass,filterFlags,filterGroups,this.colliders.castClosure(filterPredicate)),rawTranslationDelta.free()}computedMovement(){return VectorOps.fromRaw(this.raw.computedMovement())}computedGrounded(){return this.raw.computedGrounded()}numComputedCollisions(){return this.raw.numComputedCollisions()}computedCollision(i,out){if(this.raw.computedCollision(i,this.rawCharacterCollision)){let c=this.rawCharacterCollision;return(out=null!=out?out:new CharacterCollision).translationDeltaApplied=VectorOps.fromRaw(c.translationDeltaApplied()),out.translationDeltaRemaining=VectorOps.fromRaw(c.translationDeltaRemaining()),out.toi=c.toi(),out.witness1=VectorOps.fromRaw(c.worldWitness1()),out.witness2=VectorOps.fromRaw(c.worldWitness2()),out.normal1=VectorOps.fromRaw(c.worldNormal1()),out.normal2=VectorOps.fromRaw(c.worldNormal2()),out.collider=this.colliders.get(c.handle()),out}return null}}export{CharacterCollision,KinematicCharacterController};
-//# sourceMappingURL=character_controller.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@dimforge/rapier3d/control/character_controller.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"character_controller.js","sources":["../../../../../../../../../../../../node_modules/@dimforge/rapier3d/control/character_controller.js"],"sourcesContent":["import { RawKinematicCharacterController, RawCharacterCollision } from \"../raw\";\nimport { VectorOps } from \"../math\";\n/**\n * A collision between the character and an obstacle hit on its path.\n */\nexport class CharacterCollision {\n}\n/**\n * A character controller for controlling kinematic bodies and parentless colliders by hitting\n * and sliding against obstacles.\n */\nexport class KinematicCharacterController {\n    constructor(offset, params, broadPhase, narrowPhase, bodies, colliders) {\n        this.params = params;\n        this.bodies = bodies;\n        this.colliders = colliders;\n        this.broadPhase = broadPhase;\n        this.narrowPhase = narrowPhase;\n        this.raw = new RawKinematicCharacterController(offset);\n        this.rawCharacterCollision = new RawCharacterCollision();\n        this._applyImpulsesToDynamicBodies = false;\n        this._characterMass = null;\n    }\n    /** @internal */\n    free() {\n        if (!!this.raw) {\n            this.raw.free();\n            this.rawCharacterCollision.free();\n        }\n        this.raw = undefined;\n        this.rawCharacterCollision = undefined;\n    }\n    /**\n     * The direction that goes \"up\". Used to determine where the floor is, and the floor’s angle.\n     */\n    up() {\n        return this.raw.up();\n    }\n    /**\n     * Sets the direction that goes \"up\". Used to determine where the floor is, and the floor’s angle.\n     */\n    setUp(vector) {\n        let rawVect = VectorOps.intoRaw(vector);\n        return this.raw.setUp(rawVect);\n        rawVect.free();\n    }\n    applyImpulsesToDynamicBodies() {\n        return this._applyImpulsesToDynamicBodies;\n    }\n    setApplyImpulsesToDynamicBodies(enabled) {\n        this._applyImpulsesToDynamicBodies = enabled;\n    }\n    /**\n     * Returns the custom value of the character mass, if it was set by `this.setCharacterMass`.\n     */\n    characterMass() {\n        return this._characterMass;\n    }\n    /**\n     * Set the mass of the character to be used for impulse resolution if `self.applyImpulsesToDynamicBodies`\n     * is set to `true`.\n     *\n     * If no character mass is set explicitly (or if it is set to `null`) it is automatically assumed to be equal\n     * to the mass of the rigid-body the character collider is attached to; or equal to 0 if the character collider\n     * isn’t attached to any rigid-body.\n     *\n     * @param mass - The mass to set.\n     */\n    setCharacterMass(mass) {\n        this._characterMass = mass;\n    }\n    /**\n     * A small gap to preserve between the character and its surroundings.\n     *\n     * This value should not be too large to avoid visual artifacts, but shouldn’t be too small\n     * (must not be zero) to improve numerical stability of the character controller.\n     */\n    offset() {\n        return this.raw.offset();\n    }\n    /**\n     * Sets a small gap to preserve between the character and its surroundings.\n     *\n     * This value should not be too large to avoid visual artifacts, but shouldn’t be too small\n     * (must not be zero) to improve numerical stability of the character controller.\n     */\n    setOffset(value) {\n        this.raw.setOffset(value);\n    }\n    /// Increase this number if your character appears to get stuck when sliding against surfaces.\n    ///\n    /// This is a small distance applied to the movement toward the contact normals of shapes hit\n    /// by the character controller. This helps shape-casting not getting stuck in an always-penetrating\n    /// state during the sliding calculation.\n    ///\n    /// This value should remain fairly small since it can introduce artificial \"bumps\" when sliding\n    /// along a flat surface.\n    normalNudgeFactor() {\n        return this.raw.normalNudgeFactor();\n    }\n    /// Increase this number if your character appears to get stuck when sliding against surfaces.\n    ///\n    /// This is a small distance applied to the movement toward the contact normals of shapes hit\n    /// by the character controller. This helps shape-casting not getting stuck in an always-penetrating\n    /// state during the sliding calculation.\n    ///\n    /// This value should remain fairly small since it can introduce artificial \"bumps\" when sliding\n    /// along a flat surface.\n    setNormalNudgeFactor(value) {\n        this.raw.setNormalNudgeFactor(value);\n    }\n    /**\n     * Is sliding against obstacles enabled?\n     */\n    slideEnabled() {\n        return this.raw.slideEnabled();\n    }\n    /**\n     * Enable or disable sliding against obstacles.\n     */\n    setSlideEnabled(enabled) {\n        this.raw.setSlideEnabled(enabled);\n    }\n    /**\n     * The maximum step height a character can automatically step over.\n     */\n    autostepMaxHeight() {\n        return this.raw.autostepMaxHeight();\n    }\n    /**\n     * The minimum width of free space that must be available after stepping on a stair.\n     */\n    autostepMinWidth() {\n        return this.raw.autostepMinWidth();\n    }\n    /**\n     * Can the character automatically step over dynamic bodies too?\n     */\n    autostepIncludesDynamicBodies() {\n        return this.raw.autostepIncludesDynamicBodies();\n    }\n    /**\n     * Is automatically stepping over small objects enabled?\n     */\n    autostepEnabled() {\n        return this.raw.autostepEnabled();\n    }\n    /**\n     * Enabled automatically stepping over small objects.\n     *\n     * @param maxHeight - The maximum step height a character can automatically step over.\n     * @param minWidth - The minimum width of free space that must be available after stepping on a stair.\n     * @param includeDynamicBodies - Can the character automatically step over dynamic bodies too?\n     */\n    enableAutostep(maxHeight, minWidth, includeDynamicBodies) {\n        this.raw.enableAutostep(maxHeight, minWidth, includeDynamicBodies);\n    }\n    /**\n     * Disable automatically stepping over small objects.\n     */\n    disableAutostep() {\n        return this.raw.disableAutostep();\n    }\n    /**\n     * The maximum angle (radians) between the floor’s normal and the `up` vector that the\n     * character is able to climb.\n     */\n    maxSlopeClimbAngle() {\n        return this.raw.maxSlopeClimbAngle();\n    }\n    /**\n     * Sets the maximum angle (radians) between the floor’s normal and the `up` vector that the\n     * character is able to climb.\n     */\n    setMaxSlopeClimbAngle(angle) {\n        this.raw.setMaxSlopeClimbAngle(angle);\n    }\n    /**\n     * The minimum angle (radians) between the floor’s normal and the `up` vector before the\n     * character starts to slide down automatically.\n     */\n    minSlopeSlideAngle() {\n        return this.raw.minSlopeSlideAngle();\n    }\n    /**\n     * Sets the minimum angle (radians) between the floor’s normal and the `up` vector before the\n     * character starts to slide down automatically.\n     */\n    setMinSlopeSlideAngle(angle) {\n        this.raw.setMinSlopeSlideAngle(angle);\n    }\n    /**\n     * If snap-to-ground is enabled, should the character be automatically snapped to the ground if\n     * the distance between the ground and its feet are smaller than the specified threshold?\n     */\n    snapToGroundDistance() {\n        return this.raw.snapToGroundDistance();\n    }\n    /**\n     * Enables automatically snapping the character to the ground if the distance between\n     * the ground and its feet are smaller than the specified threshold.\n     */\n    enableSnapToGround(distance) {\n        this.raw.enableSnapToGround(distance);\n    }\n    /**\n     * Disables automatically snapping the character to the ground.\n     */\n    disableSnapToGround() {\n        this.raw.disableSnapToGround();\n    }\n    /**\n     * Is automatically snapping the character to the ground enabled?\n     */\n    snapToGroundEnabled() {\n        return this.raw.snapToGroundEnabled();\n    }\n    /**\n     * Computes the movement the given collider is able to execute after hitting and sliding on obstacles.\n     *\n     * @param collider - The collider to move.\n     * @param desiredTranslationDelta - The desired collider movement.\n     * @param filterFlags - Flags for excluding whole subsets of colliders from the obstacles taken into account.\n     * @param filterGroups - Groups for excluding colliders with incompatible collision groups from the obstacles\n     *                       taken into account.\n     * @param filterPredicate - Any collider for which this closure returns `false` will be excluded from the\n     *                          obstacles taken into account.\n     */\n    computeColliderMovement(collider, desiredTranslationDelta, filterFlags, filterGroups, filterPredicate) {\n        let rawTranslationDelta = VectorOps.intoRaw(desiredTranslationDelta);\n        this.raw.computeColliderMovement(this.params.dt, this.broadPhase.raw, this.narrowPhase.raw, this.bodies.raw, this.colliders.raw, collider.handle, rawTranslationDelta, this._applyImpulsesToDynamicBodies, this._characterMass, filterFlags, filterGroups, this.colliders.castClosure(filterPredicate));\n        rawTranslationDelta.free();\n    }\n    /**\n     * The movement computed by the last call to `this.computeColliderMovement`.\n     */\n    computedMovement() {\n        return VectorOps.fromRaw(this.raw.computedMovement());\n    }\n    /**\n     * The result of ground detection computed by the last call to `this.computeColliderMovement`.\n     */\n    computedGrounded() {\n        return this.raw.computedGrounded();\n    }\n    /**\n     * The number of collisions against obstacles detected along the path of the last call\n     * to `this.computeColliderMovement`.\n     */\n    numComputedCollisions() {\n        return this.raw.numComputedCollisions();\n    }\n    /**\n     * Returns the collision against one of the obstacles detected along the path of the last\n     * call to `this.computeColliderMovement`.\n     *\n     * @param i - The i-th collision will be returned.\n     * @param out - If this argument is set, it will be filled with the collision information.\n     */\n    computedCollision(i, out) {\n        if (!this.raw.computedCollision(i, this.rawCharacterCollision)) {\n            return null;\n        }\n        else {\n            let c = this.rawCharacterCollision;\n            out = out !== null && out !== void 0 ? out : new CharacterCollision();\n            out.translationDeltaApplied = VectorOps.fromRaw(c.translationDeltaApplied());\n            out.translationDeltaRemaining = VectorOps.fromRaw(c.translationDeltaRemaining());\n            out.toi = c.toi();\n            out.witness1 = VectorOps.fromRaw(c.worldWitness1());\n            out.witness2 = VectorOps.fromRaw(c.worldWitness2());\n            out.normal1 = VectorOps.fromRaw(c.worldNormal1());\n            out.normal2 = VectorOps.fromRaw(c.worldNormal2());\n            out.collider = this.colliders.get(c.handle());\n            return out;\n        }\n    }\n}\n//# sourceMappingURL=character_controller.js.map"],"names":["CharacterCollision","KinematicCharacterController","constructor","offset","params","broadPhase","narrowPhase","bodies","colliders","this","raw","RawKinematicCharacterController","rawCharacterCollision","RawCharacterCollision","_applyImpulsesToDynamicBodies","_characterMass","free","undefined","up","setUp","vector","rawVect","VectorOps","intoRaw","applyImpulsesToDynamicBodies","setApplyImpulsesToDynamicBodies","enabled","characterMass","setCharacterMass","mass","setOffset","value","normalNudgeFactor","setNormalNudgeFactor","slideEnabled","setSlideEnabled","autostepMaxHeight","autostepMinWidth","autostepIncludesDynamicBodies","autostepEnabled","enableAutostep","maxHeight","minWidth","includeDynamicBodies","disableAutostep","maxSlopeClimbAngle","setMaxSlopeClimbAngle","angle","minSlopeSlideAngle","setMinSlopeSlideAngle","snapToGroundDistance","enableSnapToGround","distance","disableSnapToGround","snapToGroundEnabled","computeColliderMovement","collider","desiredTranslationDelta","filterFlags","filterGroups","filterPredicate","rawTranslationDelta","dt","handle","castClosure","computedMovement","fromRaw","computedGrounded","numComputedCollisions","computedCollision","i","out","c","translationDeltaApplied","translationDeltaRemaining","toi","witness1","worldWitness1","witness2","worldWitness2","normal1","worldNormal1","normal2","worldNormal2","get"],"mappings":"wJAKO,MAAMA,oBAMN,MAAMC,6BACT,WAAAC,CAAYC,OAAQC,OAAQC,WAAYC,YAAaC,OAAQC,WACzDC,KAAKL,OAASA,OACdK,KAAKF,OAASA,OACdE,KAAKD,UAAYA,UACjBC,KAAKJ,WAAaA,WAClBI,KAAKH,YAAcA,YACnBG,KAAKC,IAAM,IAAIC,gCAAgCR,QAC/CM,KAAKG,sBAAwB,IAAIC,sBACjCJ,KAAKK,+BAAgC,EACrCL,KAAKM,eAAiB,IAC1B,CAEA,IAAAC,GACUP,KAAKC,MACPD,KAAKC,IAAIM,OACTP,KAAKG,sBAAsBI,QAE/BP,KAAKC,SAAMO,EACXR,KAAKG,2BAAwBK,CACjC,CAIA,EAAAC,GACI,OAAOT,KAAKC,IAAIQ,IACpB,CAIA,KAAAC,CAAMC,QACF,IAAIC,QAAUC,UAAUC,QAAQH,QAChC,OAAOX,KAAKC,IAAIS,MAAME,QAE1B,CACA,4BAAAG,GACI,OAAOf,KAAKK,6BAChB,CACA,+BAAAW,CAAgCC,SAC5BjB,KAAKK,8BAAgCY,OACzC,CAIA,aAAAC,GACI,OAAOlB,KAAKM,cAChB,CAWA,gBAAAa,CAAiBC,MACbpB,KAAKM,eAAiBc,IAC1B,CAOA,MAAA1B,GACI,OAAOM,KAAKC,IAAIP,QACpB,CAOA,SAAA2B,CAAUC,OACNtB,KAAKC,IAAIoB,UAAUC,MACvB,CASA,iBAAAC,GACI,OAAOvB,KAAKC,IAAIsB,mBACpB,CASA,oBAAAC,CAAqBF,OACjBtB,KAAKC,IAAIuB,qBAAqBF,MAClC,CAIA,YAAAG,GACI,OAAOzB,KAAKC,IAAIwB,cACpB,CAIA,eAAAC,CAAgBT,SACZjB,KAAKC,IAAIyB,gBAAgBT,QAC7B,CAIA,iBAAAU,GACI,OAAO3B,KAAKC,IAAI0B,mBACpB,CAIA,gBAAAC,GACI,OAAO5B,KAAKC,IAAI2B,kBACpB,CAIA,6BAAAC,GACI,OAAO7B,KAAKC,IAAI4B,+BACpB,CAIA,eAAAC,GACI,OAAO9B,KAAKC,IAAI6B,iBACpB,CAQA,cAAAC,CAAeC,UAAWC,SAAUC,sBAChClC,KAAKC,IAAI8B,eAAeC,UAAWC,SAAUC,qBACjD,CAIA,eAAAC,GACI,OAAOnC,KAAKC,IAAIkC,iBACpB,CAKA,kBAAAC,GACI,OAAOpC,KAAKC,IAAImC,oBACpB,CAKA,qBAAAC,CAAsBC,OAClBtC,KAAKC,IAAIoC,sBAAsBC,MACnC,CAKA,kBAAAC,GACI,OAAOvC,KAAKC,IAAIsC,oBACpB,CAKA,qBAAAC,CAAsBF,OAClBtC,KAAKC,IAAIuC,sBAAsBF,MACnC,CAKA,oBAAAG,GACI,OAAOzC,KAAKC,IAAIwC,sBACpB,CAKA,kBAAAC,CAAmBC,UACf3C,KAAKC,IAAIyC,mBAAmBC,SAChC,CAIA,mBAAAC,GACI5C,KAAKC,IAAI2C,qBACb,CAIA,mBAAAC,GACI,OAAO7C,KAAKC,IAAI4C,qBACpB,CAYA,uBAAAC,CAAwBC,SAAUC,wBAAyBC,YAAaC,aAAcC,iBAClF,IAAIC,oBAAsBvC,UAAUC,QAAQkC,yBAC5ChD,KAAKC,IAAI6C,wBAAwB9C,KAAKL,OAAO0D,GAAIrD,KAAKJ,WAAWK,IAAKD,KAAKH,YAAYI,IAAKD,KAAKF,OAAOG,IAAKD,KAAKD,UAAUE,IAAK8C,SAASO,OAAQF,oBAAqBpD,KAAKK,8BAA+BL,KAAKM,eAAgB2C,YAAaC,aAAclD,KAAKD,UAAUwD,YAAYJ,kBACtRC,oBAAoB7C,MACxB,CAIA,gBAAAiD,GACI,OAAO3C,UAAU4C,QAAQzD,KAAKC,IAAIuD,mBACtC,CAIA,gBAAAE,GACI,OAAO1D,KAAKC,IAAIyD,kBACpB,CAKA,qBAAAC,GACI,OAAO3D,KAAKC,IAAI0D,uBACpB,CAQA,iBAAAC,CAAkBC,EAAGC,KACjB,GAAK9D,KAAKC,IAAI2D,kBAAkBC,EAAG7D,KAAKG,uBAGnC,CACD,IAAI4D,EAAI/D,KAAKG,sBAUb,OATA2D,IAAMA,UAAiCA,IAAM,IAAIvE,oBAC7CyE,wBAA0BnD,UAAU4C,QAAQM,EAAEC,2BAClDF,IAAIG,0BAA4BpD,UAAU4C,QAAQM,EAAEE,6BACpDH,IAAII,IAAMH,EAAEG,MACZJ,IAAIK,SAAWtD,UAAU4C,QAAQM,EAAEK,iBACnCN,IAAIO,SAAWxD,UAAU4C,QAAQM,EAAEO,iBACnCR,IAAIS,QAAU1D,UAAU4C,QAAQM,EAAES,gBAClCV,IAAIW,QAAU5D,UAAU4C,QAAQM,EAAEW,gBAClCZ,IAAIf,SAAW/C,KAAKD,UAAU4E,IAAIZ,EAAET,UAC7BQ,GACX,CAdI,OAAO,IAef","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/@dimforge/rapier3d/control/pid_controller.js

@@ -1,2 +0,0 @@
-import"../rapier_wasm3d.js";import{VectorOps,RotationOps}from"../math.js";import{RawPidController}from"../rapier_wasm3d_bg.js";var PidAxesMask;!function(PidAxesMask){PidAxesMask[PidAxesMask.None=0]="None",PidAxesMask[PidAxesMask.LinX=1]="LinX",PidAxesMask[PidAxesMask.LinY=2]="LinY",PidAxesMask[PidAxesMask.LinZ=4]="LinZ",PidAxesMask[PidAxesMask.AngX=8]="AngX",PidAxesMask[PidAxesMask.AngY=16]="AngY",PidAxesMask[PidAxesMask.AngZ=32]="AngZ",PidAxesMask[PidAxesMask.AllLin=7]="AllLin",PidAxesMask[PidAxesMask.AllAng=56]="AllAng",PidAxesMask[PidAxesMask.All=63]="All"}(PidAxesMask||(PidAxesMask={}));class PidController{constructor(params,bodies,kp,ki,kd,axes){this.params=params,this.bodies=bodies,this.raw=new RawPidController(kp,ki,kd,axes)}free(){this.raw&&this.raw.free(),this.raw=void 0}setKp(kp,axes){this.raw.set_kp(kp,axes)}setKi(ki,axes){this.raw.set_kp(ki,axes)}setKd(kd,axes){this.raw.set_kp(kd,axes)}setAxes(axes){this.raw.set_axes_mask(axes)}resetIntegrals(){this.raw.reset_integrals()}applyLinearCorrection(body,targetPosition,targetLinvel){let rawPos=VectorOps.intoRaw(targetPosition),rawVel=VectorOps.intoRaw(targetLinvel);this.raw.apply_linear_correction(this.params.dt,this.bodies.raw,body.handle,rawPos,rawVel),rawPos.free(),rawVel.free()}applyAngularCorrection(body,targetRotation,targetAngVel){let rawPos=RotationOps.intoRaw(targetRotation),rawVel=VectorOps.intoRaw(targetAngVel);this.raw.apply_angular_correction(this.params.dt,this.bodies.raw,body.handle,rawPos,rawVel),rawPos.free(),rawVel.free()}linearCorrection(body,targetPosition,targetLinvel){let rawPos=VectorOps.intoRaw(targetPosition),rawVel=VectorOps.intoRaw(targetLinvel),correction=this.raw.linear_correction(this.params.dt,this.bodies.raw,body.handle,rawPos,rawVel);return rawPos.free(),rawVel.free(),VectorOps.fromRaw(correction)}angularCorrection(body,targetRotation,targetAngVel){let rawPos=RotationOps.intoRaw(targetRotation),rawVel=VectorOps.intoRaw(targetAngVel),correction=this.raw.angular_correction(this.params.dt,this.bodies.raw,body.handle,rawPos,rawVel);return rawPos.free(),rawVel.free(),VectorOps.fromRaw(correction)}}export{PidAxesMask,PidController};
-//# sourceMappingURL=pid_controller.js.map