@hellpig/anarchy-engine 21.3.0 → 21.4.1

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_mapCacheSet.js

@@ -0,0 +1,2 @@
+import getMapData from"./_getMapData.js";function mapCacheSet(key,value){var data=getMapData(this,key),size=data.size;return data.set(key,value),this.size+=data.size==size?0:1,this}export{mapCacheSet as default};
+//# sourceMappingURL=_mapCacheSet.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_mapCacheSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_mapCacheSet.js","sources":["../../../../../../../../../../node_modules/lodash-es/_mapCacheSet.js"],"sourcesContent":["import getMapData from './_getMapData.js';\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nexport default mapCacheSet;\n"],"names":["mapCacheSet","key","value","data","getMapData","this","size","set"],"mappings":"yCAYA,SAASA,YAAYC,IAAKC,OACxB,IAAIC,KAAOC,WAAWC,KAAMJ,KACxBK,KAAOH,KAAKG,KAIhB,OAFAH,KAAKI,IAAIN,IAAKC,OACdG,KAAKC,MAAQH,KAAKG,MAAQA,KAAO,EAAI,EAC9BD,IACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_mapToArray.js

@@ -0,0 +1,2 @@
+function mapToArray(map){var index=-1,result=Array(map.size);return map.forEach(function(value,key){result[++index]=[key,value]}),result}export{mapToArray as default};
+//# sourceMappingURL=_mapToArray.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_mapToArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_mapToArray.js","sources":["../../../../../../../../../../node_modules/lodash-es/_mapToArray.js"],"sourcesContent":["/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nexport default mapToArray;\n"],"names":["mapToArray","map","index","result","Array","size","forEach","value","key"],"mappings":"AAOA,SAASA,WAAWC,KAClB,IAAIC,OAAQ,EACRC,OAASC,MAAMH,IAAII,MAKvB,OAHAJ,IAAIK,QAAQ,SAASC,MAAOC,KAC1BL,SAASD,OAAS,CAACM,IAAKD,MAC1B,GACOJ,MACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_nativeCreate.js

@@ -0,0 +1,2 @@
+import getNative from"./_getNative.js";var nativeCreate=getNative(Object,"create");export{nativeCreate as default};
+//# sourceMappingURL=_nativeCreate.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_nativeCreate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_nativeCreate.js","sources":["../../../../../../../../../../node_modules/lodash-es/_nativeCreate.js"],"sourcesContent":["import getNative from './_getNative.js';\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nexport default nativeCreate;\n"],"names":["nativeCreate","getNative","Object"],"mappings":"uCAGG,IAACA,aAAeC,UAAUC,OAAQ","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_nativeKeys.js

@@ -0,0 +1,2 @@
+import overArg from"./_overArg.js";var nativeKeys=overArg(Object.keys,Object);export{nativeKeys as default};
+//# sourceMappingURL=_nativeKeys.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_nativeKeys.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_nativeKeys.js","sources":["../../../../../../../../../../node_modules/lodash-es/_nativeKeys.js"],"sourcesContent":["import overArg from './_overArg.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nexport default nativeKeys;\n"],"names":["nativeKeys","overArg","Object","keys"],"mappings":"mCAGG,IAACA,WAAaC,QAAQC,OAAOC,KAAMD","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_nodeUtil.js

@@ -0,0 +1,2 @@
+import freeGlobal from"./_freeGlobal.js";var freeExports="object"==typeof exports&&exports&&!exports.nodeType&&exports,freeModule=freeExports&&"object"==typeof module&&module&&!module.nodeType&&module,freeProcess=freeModule&&freeModule.exports===freeExports&&freeGlobal.process,nodeUtil=function(){try{return freeModule&&freeModule.require&&freeModule.require("util").types||freeProcess&&freeProcess.binding&&freeProcess.binding("util")}catch(e){}}();export{nodeUtil as default};
+//# sourceMappingURL=_nodeUtil.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_nodeUtil.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_nodeUtil.js","sources":["../../../../../../../../../../node_modules/lodash-es/_nodeUtil.js"],"sourcesContent":["import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nexport default nodeUtil;\n"],"names":["freeExports","exports","nodeType","freeModule","module","freeProcess","freeGlobal","process","nodeUtil","require","types","binding","e"],"mappings":"yCAGA,IAAIA,YAAgC,iBAAXC,SAAuBA,UAAYA,QAAQC,UAAYD,QAG5EE,WAAaH,aAAgC,iBAAVI,QAAsBA,SAAWA,OAAOF,UAAYE,OAMvFC,YAHgBF,YAAcA,WAAWF,UAAYD,aAGtBM,WAAWC,QAG1CC,SAAY,WACd,IAIE,OAFYL,YAAcA,WAAWM,SAAWN,WAAWM,QAAQ,QAAQC,OAOpEL,aAAeA,YAAYM,SAAWN,YAAYM,QAAQ,OACnE,CAAE,MAAOC,GAAI,CACf","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_objectToString.js

@@ -0,0 +1,2 @@
+var nativeObjectToString=Object.prototype.toString;function objectToString(value){return nativeObjectToString.call(value)}export{objectToString as default};
+//# sourceMappingURL=_objectToString.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_objectToString.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_objectToString.js","sources":["../../../../../../../../../../node_modules/lodash-es/_objectToString.js"],"sourcesContent":["/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nexport default objectToString;\n"],"names":["nativeObjectToString","Object","prototype","toString","objectToString","value","call"],"mappings":"AACA,IAOIA,qBAPcC,OAAOC,UAOcC,SASvC,SAASC,eAAeC,OACtB,OAAOL,qBAAqBM,KAAKD,MACnC","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_overArg.js

@@ -0,0 +1,2 @@
+function overArg(func,transform){return function(arg){return func(transform(arg))}}export{overArg as default};
+//# sourceMappingURL=_overArg.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_overArg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_overArg.js","sources":["../../../../../../../../../../node_modules/lodash-es/_overArg.js"],"sourcesContent":["/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nexport default overArg;\n"],"names":["overArg","func","transform","arg"],"mappings":"AAQA,SAASA,QAAQC,KAAMC,WACrB,OAAO,SAASC,KACd,OAAOF,KAAKC,UAAUC,KACxB,CACF","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_root.js

@@ -0,0 +1,2 @@
+import freeGlobal from"./_freeGlobal.js";var freeSelf="object"==typeof self&&self&&self.Object===Object&&self,root=freeGlobal||freeSelf||Function("return this")();export{root as default};
+//# sourceMappingURL=_root.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_root.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_root.js","sources":["../../../../../../../../../../node_modules/lodash-es/_root.js"],"sourcesContent":["import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n"],"names":["freeSelf","self","Object","root","freeGlobal","Function"],"mappings":"yCAGA,IAAIA,SAA0B,iBAARC,MAAoBA,MAAQA,KAAKC,SAAWA,QAAUD,KAGxEE,KAAOC,YAAcJ,UAAYK,SAAS,cAATA","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_setCacheAdd.js

@@ -0,0 +1,2 @@
+function setCacheAdd(value){return this.__data__.set(value,"__lodash_hash_undefined__"),this}export{setCacheAdd as default};
+//# sourceMappingURL=_setCacheAdd.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_setCacheAdd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_setCacheAdd.js","sources":["../../../../../../../../../../node_modules/lodash-es/_setCacheAdd.js"],"sourcesContent":["/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nexport default setCacheAdd;\n"],"names":["setCacheAdd","value","this","__data__","set"],"mappings":"AAaA,SAASA,YAAYC,OAEnB,OADAC,KAAKC,SAASC,IAAIH,MAbC,6BAcZC,IACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_setCacheHas.js

@@ -0,0 +1,2 @@
+function setCacheHas(value){return this.__data__.has(value)}export{setCacheHas as default};
+//# sourceMappingURL=_setCacheHas.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_setCacheHas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_setCacheHas.js","sources":["../../../../../../../../../../node_modules/lodash-es/_setCacheHas.js"],"sourcesContent":["/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nexport default setCacheHas;\n"],"names":["setCacheHas","value","this","__data__","has"],"mappings":"AASA,SAASA,YAAYC,OACnB,OAAOC,KAAKC,SAASC,IAAIH,MAC3B","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_setToArray.js

@@ -0,0 +1,2 @@
+function setToArray(set){var index=-1,result=Array(set.size);return set.forEach(function(value){result[++index]=value}),result}export{setToArray as default};
+//# sourceMappingURL=_setToArray.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_setToArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_setToArray.js","sources":["../../../../../../../../../../node_modules/lodash-es/_setToArray.js"],"sourcesContent":["/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nexport default setToArray;\n"],"names":["setToArray","set","index","result","Array","size","forEach","value"],"mappings":"AAOA,SAASA,WAAWC,KAClB,IAAIC,OAAQ,EACRC,OAASC,MAAMH,IAAII,MAKvB,OAHAJ,IAAIK,QAAQ,SAASC,OACnBJ,SAASD,OAASK,KACpB,GACOJ,MACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackClear.js

@@ -0,0 +1,2 @@
+import ListCache from"./_ListCache.js";function stackClear(){this.__data__=new ListCache,this.size=0}export{stackClear as default};
+//# sourceMappingURL=_stackClear.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackClear.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_stackClear.js","sources":["../../../../../../../../../../node_modules/lodash-es/_stackClear.js"],"sourcesContent":["import ListCache from './_ListCache.js';\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nexport default stackClear;\n"],"names":["stackClear","this","__data__","ListCache","size"],"mappings":"uCASA,SAASA,aACPC,KAAKC,SAAW,IAAIC,UACpBF,KAAKG,KAAO,CACd","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackDelete.js

@@ -0,0 +1,2 @@
+function stackDelete(key){var data=this.__data__,result=data.delete(key);return this.size=data.size,result}export{stackDelete as default};
+//# sourceMappingURL=_stackDelete.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackDelete.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_stackDelete.js","sources":["../../../../../../../../../../node_modules/lodash-es/_stackDelete.js"],"sourcesContent":["/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nexport default stackDelete;\n"],"names":["stackDelete","key","data","this","__data__","result","size"],"mappings":"AASA,SAASA,YAAYC,KACnB,IAAIC,KAAOC,KAAKC,SACZC,OAASH,KAAa,OAAED,KAG5B,OADAE,KAAKG,KAAOJ,KAAKI,KACVD,MACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackGet.js

@@ -0,0 +1,2 @@
+function stackGet(key){return this.__data__.get(key)}export{stackGet as default};
+//# sourceMappingURL=_stackGet.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackGet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_stackGet.js","sources":["../../../../../../../../../../node_modules/lodash-es/_stackGet.js"],"sourcesContent":["/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nexport default stackGet;\n"],"names":["stackGet","key","this","__data__","get"],"mappings":"AASA,SAASA,SAASC,KAChB,OAAOC,KAAKC,SAASC,IAAIH,IAC3B","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackHas.js

@@ -0,0 +1,2 @@
+function stackHas(key){return this.__data__.has(key)}export{stackHas as default};
+//# sourceMappingURL=_stackHas.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackHas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_stackHas.js","sources":["../../../../../../../../../../node_modules/lodash-es/_stackHas.js"],"sourcesContent":["/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nexport default stackHas;\n"],"names":["stackHas","key","this","__data__","has"],"mappings":"AASA,SAASA,SAASC,KAChB,OAAOC,KAAKC,SAASC,IAAIH,IAC3B","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackSet.js

@@ -0,0 +1,2 @@
+import ListCache from"./_ListCache.js";import Map from"./_Map.js";import MapCache from"./_MapCache.js";function stackSet(key,value){var data=this.__data__;if(data instanceof ListCache){var pairs=data.__data__;if(!Map||pairs.length<199)return pairs.push([key,value]),this.size=++data.size,this;data=this.__data__=new MapCache(pairs)}return data.set(key,value),this.size=data.size,this}export{stackSet as default};
+//# sourceMappingURL=_stackSet.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_stackSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_stackSet.js","sources":["../../../../../../../../../../node_modules/lodash-es/_stackSet.js"],"sourcesContent":["import ListCache from './_ListCache.js';\nimport Map from './_Map.js';\nimport MapCache from './_MapCache.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nexport default stackSet;\n"],"names":["stackSet","key","value","data","this","__data__","ListCache","pairs","Map","length","LARGE_ARRAY_SIZE","push","size","MapCache","set"],"mappings":"uGAiBA,SAASA,SAASC,IAAKC,OACrB,IAAIC,KAAOC,KAAKC,SAChB,GAAIF,gBAAgBG,UAAW,CAC7B,IAAIC,MAAQJ,KAAKE,SACjB,IAAKG,KAAQD,MAAME,OAASC,IAG1B,OAFAH,MAAMI,KAAK,CAACV,IAAKC,QACjBE,KAAKQ,OAAST,KAAKS,KACZR,KAETD,KAAOC,KAAKC,SAAW,IAAIQ,SAASN,MACtC,CAGA,OAFAJ,KAAKW,IAAIb,IAAKC,OACdE,KAAKQ,KAAOT,KAAKS,KACVR,IACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_toSource.js

@@ -0,0 +1,2 @@
+var funcToString=Function.prototype.toString;function toSource(func){if(null!=func){try{return funcToString.call(func)}catch(e){}try{return func+""}catch(e){}}return""}export{toSource as default};
+//# sourceMappingURL=_toSource.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/_toSource.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_toSource.js","sources":["../../../../../../../../../../node_modules/lodash-es/_toSource.js"],"sourcesContent":["/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nexport default toSource;\n"],"names":["funcToString","Function","prototype","toString","toSource","func","call","e"],"mappings":"AACA,IAGIA,aAHYC,SAASC,UAGIC,SAS7B,SAASC,SAASC,MAChB,GAAY,MAARA,KAAc,CAChB,IACE,OAAOL,aAAaM,KAAKD,KAC3B,CAAE,MAAOE,GAAI,CACb,IACE,OAAQF,KAAO,EACjB,CAAE,MAAOE,GAAI,CACf,CACA,MAAO,EACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/cloneDeepWith.js

@@ -0,0 +1,2 @@
+import baseClone from"./_baseClone.js";function cloneDeepWith(value,customizer){return baseClone(value,5,customizer="function"==typeof customizer?customizer:void 0)}export{cloneDeepWith as default};
+//# sourceMappingURL=cloneDeepWith.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/cloneDeepWith.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cloneDeepWith.js","sources":["../../../../../../../../../../node_modules/lodash-es/cloneDeepWith.js"],"sourcesContent":["import baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.cloneWith` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the deep cloned value.\n * @see _.cloneWith\n * @example\n *\n * function customizer(value) {\n *   if (_.isElement(value)) {\n *     return value.cloneNode(true);\n *   }\n * }\n *\n * var el = _.cloneDeepWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 20\n */\nfunction cloneDeepWith(value, customizer) {\n  customizer = typeof customizer == 'function' ? customizer : undefined;\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n}\n\nexport default cloneDeepWith;\n"],"names":["cloneDeepWith","value","customizer","baseClone","CLONE_DEEP_FLAG","undefined"],"mappings":"uCAkCA,SAASA,cAAcC,MAAOC,YAE5B,OAAOC,UAAUF,MAAOG,EADxBF,WAAkC,mBAAdA,WAA2BA,gBAAaG,EAE9D","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/eq.js

@@ -0,0 +1,2 @@
+function eq(value,other){return value===other||value!=value&&other!=other}export{eq as default};
+//# sourceMappingURL=eq.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/eq.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eq.js","sources":["../../../../../../../../../../node_modules/lodash-es/eq.js"],"sourcesContent":["/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nexport default eq;\n"],"names":["eq","value","other"],"mappings":"AAgCA,SAASA,GAAGC,MAAOC,OACjB,OAAOD,QAAUC,OAAUD,OAAUA,OAASC,OAAUA,KAC1D","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isArguments.js

@@ -0,0 +1,2 @@
+import baseIsArguments from"./_baseIsArguments.js";import isObjectLike from"./isObjectLike.js";var objectProto=Object.prototype,hasOwnProperty=objectProto.hasOwnProperty,propertyIsEnumerable=objectProto.propertyIsEnumerable,isArguments=baseIsArguments(function(){return arguments}())?baseIsArguments:function(value){return isObjectLike(value)&&hasOwnProperty.call(value,"callee")&&!propertyIsEnumerable.call(value,"callee")};export{isArguments as default};
+//# sourceMappingURL=isArguments.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isArguments.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isArguments.js","sources":["../../../../../../../../../../node_modules/lodash-es/isArguments.js"],"sourcesContent":["import baseIsArguments from './_baseIsArguments.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nexport default isArguments;\n"],"names":["objectProto","Object","prototype","hasOwnProperty","propertyIsEnumerable","isArguments","baseIsArguments","arguments","value","isObjectLike","call"],"mappings":"+FAIA,IAAIA,YAAcC,OAAOC,UAGrBC,eAAiBH,YAAYG,eAG7BC,qBAAuBJ,YAAYI,qBAoBnCC,YAAcC,gBAAgB,WAAa,OAAOC,SAAW,CAA/B,IAAsCD,gBAAkB,SAASE,OACjG,OAAOC,aAAaD,QAAUL,eAAeO,KAAKF,MAAO,YACtDJ,qBAAqBM,KAAKF,MAAO,SACtC","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isArray.js

@@ -0,0 +1,2 @@
+var isArray=Array.isArray;export{isArray as default};
+//# sourceMappingURL=isArray.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isArray.js","sources":["../../../../../../../../../../node_modules/lodash-es/isArray.js"],"sourcesContent":["/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nexport default isArray;\n"],"names":["isArray","Array"],"mappings":"AAuBG,IAACA,QAAUC,MAAMD","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isArrayLike.js

@@ -0,0 +1,2 @@
+import isFunction from"./isFunction.js";import isLength from"./isLength.js";function isArrayLike(value){return null!=value&&isLength(value.length)&&!isFunction(value)}export{isArrayLike as default};
+//# sourceMappingURL=isArrayLike.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isArrayLike.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isArrayLike.js","sources":["../../../../../../../../../../node_modules/lodash-es/isArrayLike.js"],"sourcesContent":["import isFunction from './isFunction.js';\nimport isLength from './isLength.js';\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nexport default isArrayLike;\n"],"names":["isArrayLike","value","isLength","length","isFunction"],"mappings":"4EA4BA,SAASA,YAAYC,OACnB,OAAgB,MAATA,OAAiBC,SAASD,MAAME,UAAYC,WAAWH,MAChE","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isBuffer.js

@@ -0,0 +1,2 @@
+import root from"./_root.js";import stubFalse from"./stubFalse.js";var freeExports="object"==typeof exports&&exports&&!exports.nodeType&&exports,freeModule=freeExports&&"object"==typeof module&&module&&!module.nodeType&&module,Buffer=freeModule&&freeModule.exports===freeExports?root.Buffer:void 0,isBuffer=(Buffer?Buffer.isBuffer:void 0)||stubFalse;export{isBuffer as default};
+//# sourceMappingURL=isBuffer.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isBuffer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isBuffer.js","sources":["../../../../../../../../../../node_modules/lodash-es/isBuffer.js"],"sourcesContent":["import root from './_root.js';\nimport stubFalse from './stubFalse.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nexport default isBuffer;\n"],"names":["freeExports","exports","nodeType","freeModule","module","Buffer","root","undefined","isBuffer","stubFalse"],"mappings":"mEAIA,IAAIA,YAAgC,iBAAXC,SAAuBA,UAAYA,QAAQC,UAAYD,QAG5EE,WAAaH,aAAgC,iBAAVI,QAAsBA,SAAWA,OAAOF,UAAYE,OAMvFC,OAHgBF,YAAcA,WAAWF,UAAYD,YAG5BM,KAAKD,YAASE,EAsBvCC,UAnBiBH,OAASA,OAAOG,cAAWD,IAmBfE","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isEmpty.js

@@ -0,0 +1,2 @@
+import baseKeys from"./_baseKeys.js";import getTag from"./_getTag.js";import isArguments from"./isArguments.js";import isArray from"./isArray.js";import isArrayLike from"./isArrayLike.js";import isBuffer from"./isBuffer.js";import isPrototype from"./_isPrototype.js";import isTypedArray from"./isTypedArray.js";var hasOwnProperty=Object.prototype.hasOwnProperty;function isEmpty(value){if(null==value)return!0;if(isArrayLike(value)&&(isArray(value)||"string"==typeof value||"function"==typeof value.splice||isBuffer(value)||isTypedArray(value)||isArguments(value)))return!value.length;var tag=getTag(value);if("[object Map]"==tag||"[object Set]"==tag)return!value.size;if(isPrototype(value))return!baseKeys(value).length;for(var key in value)if(hasOwnProperty.call(value,key))return!1;return!0}export{isEmpty as default};
+//# sourceMappingURL=isEmpty.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isEmpty.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isEmpty.js","sources":["../../../../../../../../../../node_modules/lodash-es/isEmpty.js"],"sourcesContent":["import baseKeys from './_baseKeys.js';\nimport getTag from './_getTag.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isArrayLike from './isArrayLike.js';\nimport isBuffer from './isBuffer.js';\nimport isPrototype from './_isPrototype.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\nfunction isEmpty(value) {\n  if (value == null) {\n    return true;\n  }\n  if (isArrayLike(value) &&\n      (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n        isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n    return !value.length;\n  }\n  var tag = getTag(value);\n  if (tag == mapTag || tag == setTag) {\n    return !value.size;\n  }\n  if (isPrototype(value)) {\n    return !baseKeys(value).length;\n  }\n  for (var key in value) {\n    if (hasOwnProperty.call(value, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport default isEmpty;\n"],"names":["hasOwnProperty","Object","prototype","isEmpty","value","isArrayLike","isArray","splice","isBuffer","isTypedArray","isArguments","length","tag","getTag","size","isPrototype","baseKeys","key","call"],"mappings":"uTAUA,IAOIA,eAHcC,OAAOC,UAGQF,eAmCjC,SAASG,QAAQC,OACf,GAAa,MAATA,MACF,OAAO,EAET,GAAIC,YAAYD,SACXE,QAAQF,QAA0B,iBAATA,OAA4C,mBAAhBA,MAAMG,QAC1DC,SAASJ,QAAUK,aAAaL,QAAUM,YAAYN,QAC1D,OAAQA,MAAMO,OAEhB,IAAIC,IAAMC,OAAOT,OACjB,GApDW,gBAoDPQ,KAnDO,gBAmDUA,IACnB,OAAQR,MAAMU,KAEhB,GAAIC,YAAYX,OACd,OAAQY,SAASZ,OAAOO,OAE1B,IAAK,IAAIM,OAAOb,MACd,GAAIJ,eAAekB,KAAKd,MAAOa,KAC7B,OAAO,EAGX,OAAO,CACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isEqual.js

@@ -0,0 +1,2 @@
+import baseIsEqual from"./_baseIsEqual.js";function isEqual(value,other){return baseIsEqual(value,other)}export{isEqual as default};
+//# sourceMappingURL=isEqual.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isEqual.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isEqual.js","sources":["../../../../../../../../../../node_modules/lodash-es/isEqual.js"],"sourcesContent":["import baseIsEqual from './_baseIsEqual.js';\n\n/**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\nfunction isEqual(value, other) {\n  return baseIsEqual(value, other);\n}\n\nexport default isEqual;\n"],"names":["isEqual","value","other","baseIsEqual"],"mappings":"2CA8BA,SAASA,QAAQC,MAAOC,OACtB,OAAOC,YAAYF,MAAOC,MAC5B","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isFunction.js

@@ -0,0 +1,2 @@
+import baseGetTag from"./_baseGetTag.js";import isObject from"./isObject.js";function isFunction(value){if(!isObject(value))return!1;var tag=baseGetTag(value);return"[object Function]"==tag||"[object GeneratorFunction]"==tag||"[object AsyncFunction]"==tag||"[object Proxy]"==tag}export{isFunction as default};
+//# sourceMappingURL=isFunction.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isFunction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isFunction.js","sources":["../../../../../../../../../../node_modules/lodash-es/isFunction.js"],"sourcesContent":["import baseGetTag from './_baseGetTag.js';\nimport isObject from './isObject.js';\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nexport default isFunction;\n"],"names":["isFunction","value","isObject","tag","baseGetTag"],"mappings":"6EA0BA,SAASA,WAAWC,OAClB,IAAKC,SAASD,OACZ,OAAO,EAIT,IAAIE,IAAMC,WAAWH,OACrB,MA5BY,qBA4BLE,KA3BI,8BA2BcA,KA7BZ,0BA6B6BA,KA1B7B,kBA0BgDA,GAC/D","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isLength.js

@@ -0,0 +1,2 @@
+function isLength(value){return"number"==typeof value&&value>-1&&value%1==0&&value<=9007199254740991}export{isLength as default};
+//# sourceMappingURL=isLength.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isLength.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isLength.js","sources":["../../../../../../../../../../node_modules/lodash-es/isLength.js"],"sourcesContent":["/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nexport default isLength;\n"],"names":["isLength","value"],"mappings":"AA6BA,SAASA,SAASC,OAChB,MAAuB,iBAATA,OACZA,OAAQ,GAAMA,MAAQ,GAAK,GAAKA,OA9Bb,gBA+BvB","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isMap.js

@@ -0,0 +1,2 @@
+import baseIsMap from"./_baseIsMap.js";import baseUnary from"./_baseUnary.js";import nodeUtil from"./_nodeUtil.js";var nodeIsMap=nodeUtil&&nodeUtil.isMap,isMap=nodeIsMap?baseUnary(nodeIsMap):baseIsMap;export{isMap as default};
+//# sourceMappingURL=isMap.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isMap.js","sources":["../../../../../../../../../../node_modules/lodash-es/isMap.js"],"sourcesContent":["import baseIsMap from './_baseIsMap.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nexport default isMap;\n"],"names":["nodeIsMap","nodeUtil","isMap","baseUnary","baseIsMap"],"mappings":"mHAKA,IAAIA,UAAYC,UAAYA,SAASC,MAmBjCA,MAAQF,UAAYG,UAAUH,WAAaI","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isObject.js

@@ -0,0 +1,2 @@
+function isObject(value){var type=typeof value;return null!=value&&("object"==type||"function"==type)}export{isObject as default};
+//# sourceMappingURL=isObject.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isObject.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isObject.js","sources":["../../../../../../../../../../node_modules/lodash-es/isObject.js"],"sourcesContent":["/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n"],"names":["isObject","value","type"],"mappings":"AAyBA,SAASA,SAASC,OAChB,IAAIC,YAAcD,MAClB,OAAgB,MAATA,QAA0B,UAARC,MAA4B,YAARA,KAC/C","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isObjectLike.js

@@ -0,0 +1,2 @@
+function isObjectLike(value){return null!=value&&"object"==typeof value}export{isObjectLike as default};
+//# sourceMappingURL=isObjectLike.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isObjectLike.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isObjectLike.js","sources":["../../../../../../../../../../node_modules/lodash-es/isObjectLike.js"],"sourcesContent":["/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n"],"names":["isObjectLike","value"],"mappings":"AAwBA,SAASA,aAAaC,OACpB,OAAgB,MAATA,OAAiC,iBAATA,KACjC","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isPlainObject.js

@@ -0,0 +1,2 @@
+import baseGetTag from"./_baseGetTag.js";import getPrototype from"./_getPrototype.js";import isObjectLike from"./isObjectLike.js";var funcToString=Function.prototype.toString,hasOwnProperty=Object.prototype.hasOwnProperty,objectCtorString=funcToString.call(Object);function isPlainObject(value){if(!isObjectLike(value)||"[object Object]"!=baseGetTag(value))return!1;var proto=getPrototype(value);if(null===proto)return!0;var Ctor=hasOwnProperty.call(proto,"constructor")&&proto.constructor;return"function"==typeof Ctor&&Ctor instanceof Ctor&&funcToString.call(Ctor)==objectCtorString}export{isPlainObject as default};
+//# sourceMappingURL=isPlainObject.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isPlainObject.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isPlainObject.js","sources":["../../../../../../../../../../node_modules/lodash-es/isPlainObject.js"],"sourcesContent":["import baseGetTag from './_baseGetTag.js';\nimport getPrototype from './_getPrototype.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n    funcToString.call(Ctor) == objectCtorString;\n}\n\nexport default isPlainObject;\n"],"names":["funcToString","Function","prototype","toString","hasOwnProperty","Object","objectCtorString","call","isPlainObject","value","isObjectLike","baseGetTag","proto","getPrototype","Ctor","constructor"],"mappings":"kIAKA,IAOIA,aAJYC,SAASC,UAIIC,SAGzBC,eANcC,OAAOH,UAMQE,eAG7BE,iBAAmBN,aAAaO,KAAKF,QA8BzC,SAASG,cAAcC,OACrB,IAAKC,aAAaD,QA5CJ,mBA4CcE,WAAWF,OACrC,OAAO,EAET,IAAIG,MAAQC,aAAaJ,OACzB,GAAc,OAAVG,MACF,OAAO,EAET,IAAIE,KAAOV,eAAeG,KAAKK,MAAO,gBAAkBA,MAAMG,YAC9D,MAAsB,mBAARD,MAAsBA,gBAAgBA,MAClDd,aAAaO,KAAKO,OAASR,gBAC/B","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isSet.js

@@ -0,0 +1,2 @@
+import baseIsSet from"./_baseIsSet.js";import baseUnary from"./_baseUnary.js";import nodeUtil from"./_nodeUtil.js";var nodeIsSet=nodeUtil&&nodeUtil.isSet,isSet=nodeIsSet?baseUnary(nodeIsSet):baseIsSet;export{isSet as default};
+//# sourceMappingURL=isSet.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isSet.js","sources":["../../../../../../../../../../node_modules/lodash-es/isSet.js"],"sourcesContent":["import baseIsSet from './_baseIsSet.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nexport default isSet;\n"],"names":["nodeIsSet","nodeUtil","isSet","baseUnary","baseIsSet"],"mappings":"mHAKA,IAAIA,UAAYC,UAAYA,SAASC,MAmBjCA,MAAQF,UAAYG,UAAUH,WAAaI","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isTypedArray.js

@@ -0,0 +1,2 @@
+import baseIsTypedArray from"./_baseIsTypedArray.js";import baseUnary from"./_baseUnary.js";import nodeUtil from"./_nodeUtil.js";var nodeIsTypedArray=nodeUtil&&nodeUtil.isTypedArray,isTypedArray=nodeIsTypedArray?baseUnary(nodeIsTypedArray):baseIsTypedArray;export{isTypedArray as default};
+//# sourceMappingURL=isTypedArray.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/isTypedArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isTypedArray.js","sources":["../../../../../../../../../../node_modules/lodash-es/isTypedArray.js"],"sourcesContent":["import baseIsTypedArray from './_baseIsTypedArray.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nexport default isTypedArray;\n"],"names":["nodeIsTypedArray","nodeUtil","isTypedArray","baseUnary","baseIsTypedArray"],"mappings":"iIAKA,IAAIA,iBAAmBC,UAAYA,SAASC,aAmBxCA,aAAeF,iBAAmBG,UAAUH,kBAAoBI","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/keys.js

@@ -0,0 +1,2 @@
+import arrayLikeKeys from"./_arrayLikeKeys.js";import baseKeys from"./_baseKeys.js";import isArrayLike from"./isArrayLike.js";function keys(object){return isArrayLike(object)?arrayLikeKeys(object):baseKeys(object)}export{keys as default};
+//# sourceMappingURL=keys.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/keys.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"keys.js","sources":["../../../../../../../../../../node_modules/lodash-es/keys.js"],"sourcesContent":["import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeys from './_baseKeys.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nexport default keys;\n"],"names":["keys","object","isArrayLike","arrayLikeKeys","baseKeys"],"mappings":"8HAgCA,SAASA,KAAKC,QACZ,OAAOC,YAAYD,QAAUE,cAAcF,QAAUG,SAASH,OAChE","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/stubArray.js

@@ -0,0 +1,2 @@
+function stubArray(){return[]}export{stubArray as default};
+//# sourceMappingURL=stubArray.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/stubArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stubArray.js","sources":["../../../../../../../../../../node_modules/lodash-es/stubArray.js"],"sourcesContent":["/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nexport default stubArray;\n"],"names":["stubArray"],"mappings":"AAkBA,SAASA,YACP,MAAO,EACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/stubFalse.js

@@ -0,0 +1,2 @@
+function stubFalse(){return!1}export{stubFalse as default};
+//# sourceMappingURL=stubFalse.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/lodash-es/stubFalse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stubFalse.js","sources":["../../../../../../../../../../node_modules/lodash-es/stubFalse.js"],"sourcesContent":["/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nexport default stubFalse;\n"],"names":["stubFalse"],"mappings":"AAaA,SAASA,YACP,OAAO,CACT","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/quickselect/index.js

@@ -0,0 +1,2 @@
+function quickselect(arr,k,left=0,right=arr.length-1,compare=defaultCompare){for(;right>left;){if(right-left>600){const n=right-left+1,m=k-left+1,z=Math.log(n),s=.5*Math.exp(2*z/3),sd=.5*Math.sqrt(z*s*(n-s)/n)*(m-n/2<0?-1:1);quickselect(arr,k,Math.max(left,Math.floor(k-m*s/n+sd)),Math.min(right,Math.floor(k+(n-m)*s/n+sd)),compare)}const t=arr[k];let i=left,j=right;for(swap(arr,left,k),compare(arr[right],t)>0&&swap(arr,left,right);i<j;){for(swap(arr,i,j),i++,j--;compare(arr[i],t)<0;)i++;for(;compare(arr[j],t)>0;)j--}0===compare(arr[left],t)?swap(arr,left,j):(j++,swap(arr,j,right)),j<=k&&(left=j+1),k<=j&&(right=j-1)}}function swap(arr,i,j){const tmp=arr[i];arr[i]=arr[j],arr[j]=tmp}function defaultCompare(a,b){return a<b?-1:a>b?1:0}export{quickselect as default};
+//# sourceMappingURL=index.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/quickselect/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/quickselect/index.js"],"sourcesContent":["\n/**\n * Rearranges items so that all items in the [left, k] are the smallest.\n * The k-th element will have the (k - left + 1)-th smallest value in [left, right].\n *\n * @template T\n * @param {T[]} arr the array to partially sort (in place)\n * @param {number} k middle index for partial sorting (as defined above)\n * @param {number} [left=0] left index of the range to sort\n * @param {number} [right=arr.length-1] right index\n * @param {(a: T, b: T) => number} [compare = (a, b) => a - b] compare function\n */\nexport default function quickselect(arr, k, left = 0, right = arr.length - 1, compare = defaultCompare) {\n\n    while (right > left) {\n        if (right - left > 600) {\n            const n = right - left + 1;\n            const m = k - left + 1;\n            const z = Math.log(n);\n            const s = 0.5 * Math.exp(2 * z / 3);\n            const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n            const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n            const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n            quickselect(arr, k, newLeft, newRight, compare);\n        }\n\n        const t = arr[k];\n        let i = left;\n        /** @type {number} */\n        let j = right;\n\n        swap(arr, left, k);\n        if (compare(arr[right], t) > 0) swap(arr, left, right);\n\n        while (i < j) {\n            swap(arr, i, j);\n            i++;\n            j--;\n            while (compare(arr[i], t) < 0) i++;\n            while (compare(arr[j], t) > 0) j--;\n        }\n\n        if (compare(arr[left], t) === 0) swap(arr, left, j);\n        else {\n            j++;\n            swap(arr, j, right);\n        }\n\n        if (j <= k) left = j + 1;\n        if (k <= j) right = j - 1;\n    }\n}\n\n/**\n * @template T\n * @param {T[]} arr\n * @param {number} i\n * @param {number} j\n */\nfunction swap(arr, i, j) {\n    const tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n}\n\n/**\n * @template T\n * @param {T} a\n * @param {T} b\n * @returns {number}\n */\nfunction defaultCompare(a, b) {\n    return a < b ? -1 : a > b ? 1 : 0;\n}\n"],"names":["quickselect","arr","k","left","right","length","compare","defaultCompare","n","m","z","Math","log","s","exp","sd","sqrt","max","floor","min","t","i","j","swap","tmp","a","b"],"mappings":"AAYe,SAASA,YAAYC,IAAKC,EAAGC,KAAO,EAAGC,MAAQH,IAAII,OAAS,EAAGC,QAAUC,gBAEpF,KAAOH,MAAQD,MAAM,CACjB,GAAIC,MAAQD,KAAO,IAAK,CACpB,MAAMK,EAAIJ,MAAQD,KAAO,EACnBM,EAAIP,EAAIC,KAAO,EACfO,EAAIC,KAAKC,IAAIJ,GACbK,EAAI,GAAMF,KAAKG,IAAI,EAAIJ,EAAI,GAC3BK,GAAK,GAAMJ,KAAKK,KAAKN,EAAIG,GAAKL,EAAIK,GAAKL,IAAMC,EAAID,EAAI,EAAI,GAAI,EAAK,GAGxER,YAAYC,IAAKC,EAFDS,KAAKM,IAAId,KAAMQ,KAAKO,MAAMhB,EAAIO,EAAII,EAAIL,EAAIO,KACzCJ,KAAKQ,IAAIf,MAAOO,KAAKO,MAAMhB,GAAKM,EAAIC,GAAKI,EAAIL,EAAIO,KAC3BT,QAC3C,CAEA,MAAMc,EAAInB,IAAIC,GACd,IAAImB,EAAIlB,KAEJmB,EAAIlB,MAKR,IAHAmB,KAAKtB,IAAKE,KAAMD,GACZI,QAAQL,IAAIG,OAAQgB,GAAK,GAAGG,KAAKtB,IAAKE,KAAMC,OAEzCiB,EAAIC,GAAG,CAIV,IAHAC,KAAKtB,IAAKoB,EAAGC,GACbD,IACAC,IACOhB,QAAQL,IAAIoB,GAAID,GAAK,GAAGC,IAC/B,KAAOf,QAAQL,IAAIqB,GAAIF,GAAK,GAAGE,GACnC,CAE8B,IAA1BhB,QAAQL,IAAIE,MAAOiB,GAAUG,KAAKtB,IAAKE,KAAMmB,IAE7CA,IACAC,KAAKtB,IAAKqB,EAAGlB,QAGbkB,GAAKpB,IAAGC,KAAOmB,EAAI,GACnBpB,GAAKoB,IAAGlB,MAAQkB,EAAI,EAC5B,CACJ,CAQA,SAASC,KAAKtB,IAAKoB,EAAGC,GAClB,MAAME,IAAMvB,IAAIoB,GAChBpB,IAAIoB,GAAKpB,IAAIqB,GACbrB,IAAIqB,GAAKE,GACb,CAQA,SAASjB,eAAekB,EAAGC,GACvB,OAAOD,EAAIC,GAAI,EAAKD,EAAIC,EAAI,EAAI,CACpC","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/rbush/index.js

@@ -0,0 +1,2 @@
+import quickselect from"../quickselect/index.js";class RBush{constructor(maxEntries=9){this._maxEntries=Math.max(4,maxEntries),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()}all(){return this._all(this.data,[])}search(bbox){let node=this.data;const result=[];if(!intersects(bbox,node))return result;const toBBox=this.toBBox,nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?toBBox(child):child;intersects(bbox,childBBox)&&(node.leaf?result.push(child):contains(bbox,childBBox)?this._all(child,result):nodesToSearch.push(child))}node=nodesToSearch.pop()}return result}collides(bbox){let node=this.data;if(!intersects(bbox,node))return!1;const nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?this.toBBox(child):child;if(intersects(bbox,childBBox)){if(node.leaf||contains(bbox,childBBox))return!0;nodesToSearch.push(child)}}node=nodesToSearch.pop()}return!1}load(data){if(!data||!data.length)return this;if(data.length<this._minEntries){for(let i=0;i<data.length;i++)this.insert(data[i]);return this}let node=this._build(data.slice(),0,data.length-1,0);if(this.data.children.length)if(this.data.height===node.height)this._splitRoot(this.data,node);else{if(this.data.height<node.height){const tmpNode=this.data;this.data=node,node=tmpNode}this._insert(node,this.data.height-node.height-1,!0)}else this.data=node;return this}insert(item){return item&&this._insert(item,this.data.height-1),this}clear(){return this.data=createNode([]),this}remove(item,equalsFn){if(!item)return this;let node=this.data;const bbox=this.toBBox(item),path=[],indexes=[];let i,parent,goingUp;for(;node||path.length;){if(node||(node=path.pop(),parent=path[path.length-1],i=indexes.pop(),goingUp=!0),node.leaf){const index=findItem(item,node.children,equalsFn);if(-1!==index)return node.children.splice(index,1),path.push(node),this._condense(path),this}goingUp||node.leaf||!contains(node,bbox)?parent?(i++,node=parent.children[i],goingUp=!1):node=null:(path.push(node),indexes.push(i),i=0,parent=node,node=node.children[0])}return this}toBBox(item){return item}compareMinX(a,b){return a.minX-b.minX}compareMinY(a,b){return a.minY-b.minY}toJSON(){return this.data}fromJSON(data){return this.data=data,this}_all(node,result){const nodesToSearch=[];for(;node;)node.leaf?result.push(...node.children):nodesToSearch.push(...node.children),node=nodesToSearch.pop();return result}_build(items,left,right,height){const N=right-left+1;let node,M=this._maxEntries;if(N<=M)return node=createNode(items.slice(left,right+1)),calcBBox(node,this.toBBox),node;height||(height=Math.ceil(Math.log(N)/Math.log(M)),M=Math.ceil(N/Math.pow(M,height-1))),node=createNode([]),node.leaf=!1,node.height=height;const N2=Math.ceil(N/M),N1=N2*Math.ceil(Math.sqrt(M));multiSelect(items,left,right,N1,this.compareMinX);for(let i=left;i<=right;i+=N1){const right2=Math.min(i+N1-1,right);multiSelect(items,i,right2,N2,this.compareMinY);for(let j=i;j<=right2;j+=N2){const right3=Math.min(j+N2-1,right2);node.children.push(this._build(items,j,right3,height-1))}}return calcBBox(node,this.toBBox),node}_chooseSubtree(bbox,node,level,path){for(;path.push(node),!node.leaf&&path.length-1!==level;){let targetNode,minArea=1/0,minEnlargement=1/0;for(let i=0;i<node.children.length;i++){const child=node.children[i],area=bboxArea(child),enlargement=enlargedArea(bbox,child)-area;enlargement<minEnlargement?(minEnlargement=enlargement,minArea=area<minArea?area:minArea,targetNode=child):enlargement===minEnlargement&&area<minArea&&(minArea=area,targetNode=child)}node=targetNode||node.children[0]}return node}_insert(item,level,isNode){const bbox=isNode?item:this.toBBox(item),insertPath=[],node=this._chooseSubtree(bbox,this.data,level,insertPath);for(node.children.push(item),extend(node,bbox);level>=0&&insertPath[level].children.length>this._maxEntries;)this._split(insertPath,level),level--;this._adjustParentBBoxes(bbox,insertPath,level)}_split(insertPath,level){const node=insertPath[level],M=node.children.length,m=this._minEntries;this._chooseSplitAxis(node,m,M);const splitIndex=this._chooseSplitIndex(node,m,M),newNode=createNode(node.children.splice(splitIndex,node.children.length-splitIndex));newNode.height=node.height,newNode.leaf=node.leaf,calcBBox(node,this.toBBox),calcBBox(newNode,this.toBBox),level?insertPath[level-1].children.push(newNode):this._splitRoot(node,newNode)}_splitRoot(node,newNode){this.data=createNode([node,newNode]),this.data.height=node.height+1,this.data.leaf=!1,calcBBox(this.data,this.toBBox)}_chooseSplitIndex(node,m,M){let index,minOverlap=1/0,minArea=1/0;for(let i=m;i<=M-m;i++){const bbox1=distBBox(node,0,i,this.toBBox),bbox2=distBBox(node,i,M,this.toBBox),overlap=intersectionArea(bbox1,bbox2),area=bboxArea(bbox1)+bboxArea(bbox2);overlap<minOverlap?(minOverlap=overlap,index=i,minArea=area<minArea?area:minArea):overlap===minOverlap&&area<minArea&&(minArea=area,index=i)}return index||M-m}_chooseSplitAxis(node,m,M){const compareMinX=node.leaf?this.compareMinX:compareNodeMinX,compareMinY=node.leaf?this.compareMinY:compareNodeMinY;this._allDistMargin(node,m,M,compareMinX)<this._allDistMargin(node,m,M,compareMinY)&&node.children.sort(compareMinX)}_allDistMargin(node,m,M,compare){node.children.sort(compare);const toBBox=this.toBBox,leftBBox=distBBox(node,0,m,toBBox),rightBBox=distBBox(node,M-m,M,toBBox);let margin=bboxMargin(leftBBox)+bboxMargin(rightBBox);for(let i=m;i<M-m;i++){const child=node.children[i];extend(leftBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(leftBBox)}for(let i=M-m-1;i>=m;i--){const child=node.children[i];extend(rightBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(rightBBox)}return margin}_adjustParentBBoxes(bbox,path,level){for(let i=level;i>=0;i--)extend(path[i],bbox)}_condense(path){for(let siblings,i=path.length-1;i>=0;i--)0===path[i].children.length?i>0?(siblings=path[i-1].children,siblings.splice(siblings.indexOf(path[i]),1)):this.clear():calcBBox(path[i],this.toBBox)}}function findItem(item,items,equalsFn){if(!equalsFn)return items.indexOf(item);for(let i=0;i<items.length;i++)if(equalsFn(item,items[i]))return i;return-1}function calcBBox(node,toBBox){distBBox(node,0,node.children.length,toBBox,node)}function distBBox(node,k,p,toBBox,destNode){destNode||(destNode=createNode(null)),destNode.minX=1/0,destNode.minY=1/0,destNode.maxX=-1/0,destNode.maxY=-1/0;for(let i=k;i<p;i++){const child=node.children[i];extend(destNode,node.leaf?toBBox(child):child)}return destNode}function extend(a,b){return a.minX=Math.min(a.minX,b.minX),a.minY=Math.min(a.minY,b.minY),a.maxX=Math.max(a.maxX,b.maxX),a.maxY=Math.max(a.maxY,b.maxY),a}function compareNodeMinX(a,b){return a.minX-b.minX}function compareNodeMinY(a,b){return a.minY-b.minY}function bboxArea(a){return(a.maxX-a.minX)*(a.maxY-a.minY)}function bboxMargin(a){return a.maxX-a.minX+(a.maxY-a.minY)}function enlargedArea(a,b){return(Math.max(b.maxX,a.maxX)-Math.min(b.minX,a.minX))*(Math.max(b.maxY,a.maxY)-Math.min(b.minY,a.minY))}function intersectionArea(a,b){const minX=Math.max(a.minX,b.minX),minY=Math.max(a.minY,b.minY),maxX=Math.min(a.maxX,b.maxX),maxY=Math.min(a.maxY,b.maxY);return Math.max(0,maxX-minX)*Math.max(0,maxY-minY)}function contains(a,b){return a.minX<=b.minX&&a.minY<=b.minY&&b.maxX<=a.maxX&&b.maxY<=a.maxY}function intersects(a,b){return b.minX<=a.maxX&&b.minY<=a.maxY&&b.maxX>=a.minX&&b.maxY>=a.minY}function createNode(children){return{children:children,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function multiSelect(arr,left,right,n,compare){const stack=[left,right];for(;stack.length;){if((right=stack.pop())-(left=stack.pop())<=n)continue;const mid=left+Math.ceil((right-left)/n/2)*n;quickselect(arr,mid,left,right,compare),stack.push(left,mid,mid,right)}}export{RBush as default};
+//# sourceMappingURL=index.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/rbush/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/rbush/index.js"],"sourcesContent":["import quickselect from 'quickselect';\n\nexport default class RBush {\n    constructor(maxEntries = 9) {\n        // max entries in a node is 9 by default; min node fill is 40% for best performance\n        this._maxEntries = Math.max(4, maxEntries);\n        this._minEntries = Math.max(2, Math.ceil(this._maxEntries * 0.4));\n        this.clear();\n    }\n\n    all() {\n        return this._all(this.data, []);\n    }\n\n    search(bbox) {\n        let node = this.data;\n        const result = [];\n\n        if (!intersects(bbox, node)) return result;\n\n        const toBBox = this.toBBox;\n        const nodesToSearch = [];\n\n        while (node) {\n            for (let i = 0; i < node.children.length; i++) {\n                const child = node.children[i];\n                const childBBox = node.leaf ? toBBox(child) : child;\n\n                if (intersects(bbox, childBBox)) {\n                    if (node.leaf) result.push(child);\n                    else if (contains(bbox, childBBox)) this._all(child, result);\n                    else nodesToSearch.push(child);\n                }\n            }\n            node = nodesToSearch.pop();\n        }\n\n        return result;\n    }\n\n    collides(bbox) {\n        let node = this.data;\n\n        if (!intersects(bbox, node)) return false;\n\n        const nodesToSearch = [];\n        while (node) {\n            for (let i = 0; i < node.children.length; i++) {\n                const child = node.children[i];\n                const childBBox = node.leaf ? this.toBBox(child) : child;\n\n                if (intersects(bbox, childBBox)) {\n                    if (node.leaf || contains(bbox, childBBox)) return true;\n                    nodesToSearch.push(child);\n                }\n            }\n            node = nodesToSearch.pop();\n        }\n\n        return false;\n    }\n\n    load(data) {\n        if (!(data && data.length)) return this;\n\n        if (data.length < this._minEntries) {\n            for (let i = 0; i < data.length; i++) {\n                this.insert(data[i]);\n            }\n            return this;\n        }\n\n        // recursively build the tree with the given data from scratch using OMT algorithm\n        let node = this._build(data.slice(), 0, data.length - 1, 0);\n\n        if (!this.data.children.length) {\n            // save as is if tree is empty\n            this.data = node;\n\n        } else if (this.data.height === node.height) {\n            // split root if trees have the same height\n            this._splitRoot(this.data, node);\n\n        } else {\n            if (this.data.height < node.height) {\n                // swap trees if inserted one is bigger\n                const tmpNode = this.data;\n                this.data = node;\n                node = tmpNode;\n            }\n\n            // insert the small tree into the large tree at appropriate level\n            this._insert(node, this.data.height - node.height - 1, true);\n        }\n\n        return this;\n    }\n\n    insert(item) {\n        if (item) this._insert(item, this.data.height - 1);\n        return this;\n    }\n\n    clear() {\n        this.data = createNode([]);\n        return this;\n    }\n\n    remove(item, equalsFn) {\n        if (!item) return this;\n\n        let node = this.data;\n        const bbox = this.toBBox(item);\n        const path = [];\n        const indexes = [];\n        let i, parent, goingUp;\n\n        // depth-first iterative tree traversal\n        while (node || path.length) {\n\n            if (!node) { // go up\n                node = path.pop();\n                parent = path[path.length - 1];\n                i = indexes.pop();\n                goingUp = true;\n            }\n\n            if (node.leaf) { // check current node\n                const index = findItem(item, node.children, equalsFn);\n\n                if (index !== -1) {\n                    // item found, remove the item and condense tree upwards\n                    node.children.splice(index, 1);\n                    path.push(node);\n                    this._condense(path);\n                    return this;\n                }\n            }\n\n            if (!goingUp && !node.leaf && contains(node, bbox)) { // go down\n                path.push(node);\n                indexes.push(i);\n                i = 0;\n                parent = node;\n                node = node.children[0];\n\n            } else if (parent) { // go right\n                i++;\n                node = parent.children[i];\n                goingUp = false;\n\n            } else node = null; // nothing found\n        }\n\n        return this;\n    }\n\n    toBBox(item) { return item; }\n\n    compareMinX(a, b) { return a.minX - b.minX; }\n    compareMinY(a, b) { return a.minY - b.minY; }\n\n    toJSON() { return this.data; }\n\n    fromJSON(data) {\n        this.data = data;\n        return this;\n    }\n\n    _all(node, result) {\n        const nodesToSearch = [];\n        while (node) {\n            if (node.leaf) result.push(...node.children);\n            else nodesToSearch.push(...node.children);\n\n            node = nodesToSearch.pop();\n        }\n        return result;\n    }\n\n    _build(items, left, right, height) {\n\n        const N = right - left + 1;\n        let M = this._maxEntries;\n        let node;\n\n        if (N <= M) {\n            // reached leaf level; return leaf\n            node = createNode(items.slice(left, right + 1));\n            calcBBox(node, this.toBBox);\n            return node;\n        }\n\n        if (!height) {\n            // target height of the bulk-loaded tree\n            height = Math.ceil(Math.log(N) / Math.log(M));\n\n            // target number of root entries to maximize storage utilization\n            M = Math.ceil(N / Math.pow(M, height - 1));\n        }\n\n        node = createNode([]);\n        node.leaf = false;\n        node.height = height;\n\n        // split the items into M mostly square tiles\n\n        const N2 = Math.ceil(N / M);\n        const N1 = N2 * Math.ceil(Math.sqrt(M));\n\n        multiSelect(items, left, right, N1, this.compareMinX);\n\n        for (let i = left; i <= right; i += N1) {\n\n            const right2 = Math.min(i + N1 - 1, right);\n\n            multiSelect(items, i, right2, N2, this.compareMinY);\n\n            for (let j = i; j <= right2; j += N2) {\n\n                const right3 = Math.min(j + N2 - 1, right2);\n\n                // pack each entry recursively\n                node.children.push(this._build(items, j, right3, height - 1));\n            }\n        }\n\n        calcBBox(node, this.toBBox);\n\n        return node;\n    }\n\n    _chooseSubtree(bbox, node, level, path) {\n        while (true) {\n            path.push(node);\n\n            if (node.leaf || path.length - 1 === level) break;\n\n            let minArea = Infinity;\n            let minEnlargement = Infinity;\n            let targetNode;\n\n            for (let i = 0; i < node.children.length; i++) {\n                const child = node.children[i];\n                const area = bboxArea(child);\n                const enlargement = enlargedArea(bbox, child) - area;\n\n                // choose entry with the least area enlargement\n                if (enlargement < minEnlargement) {\n                    minEnlargement = enlargement;\n                    minArea = area < minArea ? area : minArea;\n                    targetNode = child;\n\n                } else if (enlargement === minEnlargement) {\n                    // otherwise choose one with the smallest area\n                    if (area < minArea) {\n                        minArea = area;\n                        targetNode = child;\n                    }\n                }\n            }\n\n            node = targetNode || node.children[0];\n        }\n\n        return node;\n    }\n\n    _insert(item, level, isNode) {\n        const bbox = isNode ? item : this.toBBox(item);\n        const insertPath = [];\n\n        // find the best node for accommodating the item, saving all nodes along the path too\n        const node = this._chooseSubtree(bbox, this.data, level, insertPath);\n\n        // put the item into the node\n        node.children.push(item);\n        extend(node, bbox);\n\n        // split on node overflow; propagate upwards if necessary\n        while (level >= 0) {\n            if (insertPath[level].children.length > this._maxEntries) {\n                this._split(insertPath, level);\n                level--;\n            } else break;\n        }\n\n        // adjust bboxes along the insertion path\n        this._adjustParentBBoxes(bbox, insertPath, level);\n    }\n\n    // split overflowed node into two\n    _split(insertPath, level) {\n        const node = insertPath[level];\n        const M = node.children.length;\n        const m = this._minEntries;\n\n        this._chooseSplitAxis(node, m, M);\n\n        const splitIndex = this._chooseSplitIndex(node, m, M);\n\n        const newNode = createNode(node.children.splice(splitIndex, node.children.length - splitIndex));\n        newNode.height = node.height;\n        newNode.leaf = node.leaf;\n\n        calcBBox(node, this.toBBox);\n        calcBBox(newNode, this.toBBox);\n\n        if (level) insertPath[level - 1].children.push(newNode);\n        else this._splitRoot(node, newNode);\n    }\n\n    _splitRoot(node, newNode) {\n        // split root node\n        this.data = createNode([node, newNode]);\n        this.data.height = node.height + 1;\n        this.data.leaf = false;\n        calcBBox(this.data, this.toBBox);\n    }\n\n    _chooseSplitIndex(node, m, M) {\n        let index;\n        let minOverlap = Infinity;\n        let minArea = Infinity;\n\n        for (let i = m; i <= M - m; i++) {\n            const bbox1 = distBBox(node, 0, i, this.toBBox);\n            const bbox2 = distBBox(node, i, M, this.toBBox);\n\n            const overlap = intersectionArea(bbox1, bbox2);\n            const area = bboxArea(bbox1) + bboxArea(bbox2);\n\n            // choose distribution with minimum overlap\n            if (overlap < minOverlap) {\n                minOverlap = overlap;\n                index = i;\n\n                minArea = area < minArea ? area : minArea;\n\n            } else if (overlap === minOverlap) {\n                // otherwise choose distribution with minimum area\n                if (area < minArea) {\n                    minArea = area;\n                    index = i;\n                }\n            }\n        }\n\n        return index || M - m;\n    }\n\n    // sorts node children by the best axis for split\n    _chooseSplitAxis(node, m, M) {\n        const compareMinX = node.leaf ? this.compareMinX : compareNodeMinX;\n        const compareMinY = node.leaf ? this.compareMinY : compareNodeMinY;\n        const xMargin = this._allDistMargin(node, m, M, compareMinX);\n        const yMargin = this._allDistMargin(node, m, M, compareMinY);\n\n        // if total distributions margin value is minimal for x, sort by minX,\n        // otherwise it's already sorted by minY\n        if (xMargin < yMargin) node.children.sort(compareMinX);\n    }\n\n    // total margin of all possible split distributions where each node is at least m full\n    _allDistMargin(node, m, M, compare) {\n        node.children.sort(compare);\n\n        const toBBox = this.toBBox;\n        const leftBBox = distBBox(node, 0, m, toBBox);\n        const rightBBox = distBBox(node, M - m, M, toBBox);\n        let margin = bboxMargin(leftBBox) + bboxMargin(rightBBox);\n\n        for (let i = m; i < M - m; i++) {\n            const child = node.children[i];\n            extend(leftBBox, node.leaf ? toBBox(child) : child);\n            margin += bboxMargin(leftBBox);\n        }\n\n        for (let i = M - m - 1; i >= m; i--) {\n            const child = node.children[i];\n            extend(rightBBox, node.leaf ? toBBox(child) : child);\n            margin += bboxMargin(rightBBox);\n        }\n\n        return margin;\n    }\n\n    _adjustParentBBoxes(bbox, path, level) {\n        // adjust bboxes along the given tree path\n        for (let i = level; i >= 0; i--) {\n            extend(path[i], bbox);\n        }\n    }\n\n    _condense(path) {\n        // go through the path, removing empty nodes and updating bboxes\n        for (let i = path.length - 1, siblings; i >= 0; i--) {\n            if (path[i].children.length === 0) {\n                if (i > 0) {\n                    siblings = path[i - 1].children;\n                    siblings.splice(siblings.indexOf(path[i]), 1);\n\n                } else this.clear();\n\n            } else calcBBox(path[i], this.toBBox);\n        }\n    }\n}\n\nfunction findItem(item, items, equalsFn) {\n    if (!equalsFn) return items.indexOf(item);\n\n    for (let i = 0; i < items.length; i++) {\n        if (equalsFn(item, items[i])) return i;\n    }\n    return -1;\n}\n\n// calculate node's bbox from bboxes of its children\nfunction calcBBox(node, toBBox) {\n    distBBox(node, 0, node.children.length, toBBox, node);\n}\n\n// min bounding rectangle of node children from k to p-1\nfunction distBBox(node, k, p, toBBox, destNode) {\n    if (!destNode) destNode = createNode(null);\n    destNode.minX = Infinity;\n    destNode.minY = Infinity;\n    destNode.maxX = -Infinity;\n    destNode.maxY = -Infinity;\n\n    for (let i = k; i < p; i++) {\n        const child = node.children[i];\n        extend(destNode, node.leaf ? toBBox(child) : child);\n    }\n\n    return destNode;\n}\n\nfunction extend(a, b) {\n    a.minX = Math.min(a.minX, b.minX);\n    a.minY = Math.min(a.minY, b.minY);\n    a.maxX = Math.max(a.maxX, b.maxX);\n    a.maxY = Math.max(a.maxY, b.maxY);\n    return a;\n}\n\nfunction compareNodeMinX(a, b) { return a.minX - b.minX; }\nfunction compareNodeMinY(a, b) { return a.minY - b.minY; }\n\nfunction bboxArea(a)   { return (a.maxX - a.minX) * (a.maxY - a.minY); }\nfunction bboxMargin(a) { return (a.maxX - a.minX) + (a.maxY - a.minY); }\n\nfunction enlargedArea(a, b) {\n    return (Math.max(b.maxX, a.maxX) - Math.min(b.minX, a.minX)) *\n           (Math.max(b.maxY, a.maxY) - Math.min(b.minY, a.minY));\n}\n\nfunction intersectionArea(a, b) {\n    const minX = Math.max(a.minX, b.minX);\n    const minY = Math.max(a.minY, b.minY);\n    const maxX = Math.min(a.maxX, b.maxX);\n    const maxY = Math.min(a.maxY, b.maxY);\n\n    return Math.max(0, maxX - minX) *\n           Math.max(0, maxY - minY);\n}\n\nfunction contains(a, b) {\n    return a.minX <= b.minX &&\n           a.minY <= b.minY &&\n           b.maxX <= a.maxX &&\n           b.maxY <= a.maxY;\n}\n\nfunction intersects(a, b) {\n    return b.minX <= a.maxX &&\n           b.minY <= a.maxY &&\n           b.maxX >= a.minX &&\n           b.maxY >= a.minY;\n}\n\nfunction createNode(children) {\n    return {\n        children,\n        height: 1,\n        leaf: true,\n        minX: Infinity,\n        minY: Infinity,\n        maxX: -Infinity,\n        maxY: -Infinity\n    };\n}\n\n// sort an array so that items come in groups of n unsorted items, with groups sorted between each other;\n// combines selection algorithm with binary divide & conquer approach\n\nfunction multiSelect(arr, left, right, n, compare) {\n    const stack = [left, right];\n\n    while (stack.length) {\n        right = stack.pop();\n        left = stack.pop();\n\n        if (right - left <= n) continue;\n\n        const mid = left + Math.ceil((right - left) / n / 2) * n;\n        quickselect(arr, mid, left, right, compare);\n\n        stack.push(left, mid, mid, right);\n    }\n}\n"],"names":["RBush","constructor","maxEntries","this","_maxEntries","Math","max","_minEntries","ceil","clear","all","_all","data","search","bbox","node","result","intersects","toBBox","nodesToSearch","i","children","length","child","childBBox","leaf","push","contains","pop","collides","load","insert","_build","slice","height","_splitRoot","tmpNode","_insert","item","createNode","remove","equalsFn","path","indexes","parent","goingUp","index","findItem","splice","_condense","compareMinX","a","b","minX","compareMinY","minY","toJSON","fromJSON","items","left","right","N","M","calcBBox","log","pow","N2","N1","sqrt","multiSelect","right2","min","j","right3","_chooseSubtree","level","targetNode","minArea","Infinity","minEnlargement","area","bboxArea","enlargement","enlargedArea","isNode","insertPath","extend","_split","_adjustParentBBoxes","m","_chooseSplitAxis","splitIndex","_chooseSplitIndex","newNode","minOverlap","bbox1","distBBox","bbox2","overlap","intersectionArea","compareNodeMinX","compareNodeMinY","_allDistMargin","sort","compare","leftBBox","rightBBox","margin","bboxMargin","siblings","indexOf","k","p","destNode","maxX","maxY","arr","n","stack","mid","quickselect"],"mappings":"iDAEe,MAAMA,MACjB,WAAAC,CAAYC,WAAa,GAErBC,KAAKC,YAAcC,KAAKC,IAAI,EAAGJ,YAC/BC,KAAKI,YAAcF,KAAKC,IAAI,EAAGD,KAAKG,KAAwB,GAAnBL,KAAKC,cAC9CD,KAAKM,OACT,CAEA,GAAAC,GACI,OAAOP,KAAKQ,KAAKR,KAAKS,KAAM,GAChC,CAEA,MAAAC,CAAOC,MACH,IAAIC,KAAOZ,KAAKS,KAChB,MAAMI,OAAS,GAEf,IAAKC,WAAWH,KAAMC,MAAO,OAAOC,OAEpC,MAAME,OAASf,KAAKe,OACdC,cAAgB,GAEtB,KAAOJ,MAAM,CACT,IAAK,IAAIK,EAAI,EAAGA,EAAIL,KAAKM,SAASC,OAAQF,IAAK,CAC3C,MAAMG,MAAQR,KAAKM,SAASD,GACtBI,UAAYT,KAAKU,KAAOP,OAAOK,OAASA,MAE1CN,WAAWH,KAAMU,aACbT,KAAKU,KAAMT,OAAOU,KAAKH,OAClBI,SAASb,KAAMU,WAAYrB,KAAKQ,KAAKY,MAAOP,QAChDG,cAAcO,KAAKH,OAEhC,CACAR,KAAOI,cAAcS,KACzB,CAEA,OAAOZ,MACX,CAEA,QAAAa,CAASf,MACL,IAAIC,KAAOZ,KAAKS,KAEhB,IAAKK,WAAWH,KAAMC,MAAO,OAAO,EAEpC,MAAMI,cAAgB,GACtB,KAAOJ,MAAM,CACT,IAAK,IAAIK,EAAI,EAAGA,EAAIL,KAAKM,SAASC,OAAQF,IAAK,CAC3C,MAAMG,MAAQR,KAAKM,SAASD,GACtBI,UAAYT,KAAKU,KAAOtB,KAAKe,OAAOK,OAASA,MAEnD,GAAIN,WAAWH,KAAMU,WAAY,CAC7B,GAAIT,KAAKU,MAAQE,SAASb,KAAMU,WAAY,OAAO,EACnDL,cAAcO,KAAKH,MACvB,CACJ,CACAR,KAAOI,cAAcS,KACzB,CAEA,OAAO,CACX,CAEA,IAAAE,CAAKlB,MACD,IAAMA,OAAQA,KAAKU,OAAS,OAAOnB,KAEnC,GAAIS,KAAKU,OAASnB,KAAKI,YAAa,CAChC,IAAK,IAAIa,EAAI,EAAGA,EAAIR,KAAKU,OAAQF,IAC7BjB,KAAK4B,OAAOnB,KAAKQ,IAErB,OAAOjB,IACX,CAGA,IAAIY,KAAOZ,KAAK6B,OAAOpB,KAAKqB,QAAS,EAAGrB,KAAKU,OAAS,EAAG,GAEzD,GAAKnB,KAAKS,KAAKS,SAASC,OAIjB,GAAInB,KAAKS,KAAKsB,SAAWnB,KAAKmB,OAEjC/B,KAAKgC,WAAWhC,KAAKS,KAAMG,UAExB,CACH,GAAIZ,KAAKS,KAAKsB,OAASnB,KAAKmB,OAAQ,CAEhC,MAAME,QAAUjC,KAAKS,KACrBT,KAAKS,KAAOG,KACZA,KAAOqB,OACX,CAGAjC,KAAKkC,QAAQtB,KAAMZ,KAAKS,KAAKsB,OAASnB,KAAKmB,OAAS,GAAG,EAC3D,MAhBI/B,KAAKS,KAAOG,KAkBhB,OAAOZ,IACX,CAEA,MAAA4B,CAAOO,MAEH,OADIA,MAAMnC,KAAKkC,QAAQC,KAAMnC,KAAKS,KAAKsB,OAAS,GACzC/B,IACX,CAEA,KAAAM,GAEI,OADAN,KAAKS,KAAO2B,WAAW,IAChBpC,IACX,CAEA,MAAAqC,CAAOF,KAAMG,UACT,IAAKH,KAAM,OAAOnC,KAElB,IAAIY,KAAOZ,KAAKS,KAChB,MAAME,KAAOX,KAAKe,OAAOoB,MACnBI,KAAO,GACPC,QAAU,GAChB,IAAIvB,EAAGwB,OAAQC,QAGf,KAAO9B,MAAQ2B,KAAKpB,QAAQ,CASxB,GAPKP,OACDA,KAAO2B,KAAKd,MACZgB,OAASF,KAAKA,KAAKpB,OAAS,GAC5BF,EAAIuB,QAAQf,MACZiB,SAAU,GAGV9B,KAAKU,KAAM,CACX,MAAMqB,MAAQC,SAAST,KAAMvB,KAAKM,SAAUoB,UAE5C,IAAc,IAAVK,MAKA,OAHA/B,KAAKM,SAAS2B,OAAOF,MAAO,GAC5BJ,KAAKhB,KAAKX,MACVZ,KAAK8C,UAAUP,MACRvC,IAEf,CAEK0C,SAAY9B,KAAKU,OAAQE,SAASZ,KAAMD,MAOlC8B,QACPxB,IACAL,KAAO6B,OAAOvB,SAASD,GACvByB,SAAU,GAEP9B,KAAO,MAXV2B,KAAKhB,KAAKX,MACV4B,QAAQjB,KAAKN,GACbA,EAAI,EACJwB,OAAS7B,KACTA,KAAOA,KAAKM,SAAS,GAQ7B,CAEA,OAAOlB,IACX,CAEA,MAAAe,CAAOoB,MAAQ,OAAOA,IAAM,CAE5B,WAAAY,CAAYC,EAAGC,GAAK,OAAOD,EAAEE,KAAOD,EAAEC,IAAM,CAC5C,WAAAC,CAAYH,EAAGC,GAAK,OAAOD,EAAEI,KAAOH,EAAEG,IAAM,CAE5C,MAAAC,GAAW,OAAOrD,KAAKS,IAAM,CAE7B,QAAA6C,CAAS7C,MAEL,OADAT,KAAKS,KAAOA,KACLT,IACX,CAEA,IAAAQ,CAAKI,KAAMC,QACP,MAAMG,cAAgB,GACtB,KAAOJ,MACCA,KAAKU,KAAMT,OAAOU,QAAQX,KAAKM,UAC9BF,cAAcO,QAAQX,KAAKM,UAEhCN,KAAOI,cAAcS,MAEzB,OAAOZ,MACX,CAEA,MAAAgB,CAAO0B,MAAOC,KAAMC,MAAO1B,QAEvB,MAAM2B,EAAID,MAAQD,KAAO,EACzB,IACI5C,KADA+C,EAAI3D,KAAKC,YAGb,GAAIyD,GAAKC,EAIL,OAFA/C,KAAOwB,WAAWmB,MAAMzB,MAAM0B,KAAMC,MAAQ,IAC5CG,SAAShD,KAAMZ,KAAKe,QACbH,KAGNmB,SAEDA,OAAS7B,KAAKG,KAAKH,KAAK2D,IAAIH,GAAKxD,KAAK2D,IAAIF,IAG1CA,EAAIzD,KAAKG,KAAKqD,EAAIxD,KAAK4D,IAAIH,EAAG5B,OAAS,KAG3CnB,KAAOwB,WAAW,IAClBxB,KAAKU,MAAO,EACZV,KAAKmB,OAASA,OAId,MAAMgC,GAAK7D,KAAKG,KAAKqD,EAAIC,GACnBK,GAAKD,GAAK7D,KAAKG,KAAKH,KAAK+D,KAAKN,IAEpCO,YAAYX,MAAOC,KAAMC,MAAOO,GAAIhE,KAAK+C,aAEzC,IAAK,IAAI9B,EAAIuC,KAAMvC,GAAKwC,MAAOxC,GAAK+C,GAAI,CAEpC,MAAMG,OAASjE,KAAKkE,IAAInD,EAAI+C,GAAK,EAAGP,OAEpCS,YAAYX,MAAOtC,EAAGkD,OAAQJ,GAAI/D,KAAKmD,aAEvC,IAAK,IAAIkB,EAAIpD,EAAGoD,GAAKF,OAAQE,GAAKN,GAAI,CAElC,MAAMO,OAASpE,KAAKkE,IAAIC,EAAIN,GAAK,EAAGI,QAGpCvD,KAAKM,SAASK,KAAKvB,KAAK6B,OAAO0B,MAAOc,EAAGC,OAAQvC,OAAS,GAC9D,CACJ,CAIA,OAFA6B,SAAShD,KAAMZ,KAAKe,QAEbH,IACX,CAEA,cAAA2D,CAAe5D,KAAMC,KAAM4D,MAAOjC,MAC9B,KACIA,KAAKhB,KAAKX,OAENA,KAAKU,MAAQiB,KAAKpB,OAAS,IAAMqD,OAH5B,CAKT,IAEIC,WAFAC,QAAUC,IACVC,eAAiBD,IAGrB,IAAK,IAAI1D,EAAI,EAAGA,EAAIL,KAAKM,SAASC,OAAQF,IAAK,CAC3C,MAAMG,MAAQR,KAAKM,SAASD,GACtB4D,KAAOC,SAAS1D,OAChB2D,YAAcC,aAAarE,KAAMS,OAASyD,KAG5CE,YAAcH,gBACdA,eAAiBG,YACjBL,QAAUG,KAAOH,QAAUG,KAAOH,QAClCD,WAAarD,OAEN2D,cAAgBH,gBAEnBC,KAAOH,UACPA,QAAUG,KACVJ,WAAarD,MAGzB,CAEAR,KAAO6D,YAAc7D,KAAKM,SAAS,EACvC,CAEA,OAAON,IACX,CAEA,OAAAsB,CAAQC,KAAMqC,MAAOS,QACjB,MAAMtE,KAAOsE,OAAS9C,KAAOnC,KAAKe,OAAOoB,MACnC+C,WAAa,GAGbtE,KAAOZ,KAAKuE,eAAe5D,KAAMX,KAAKS,KAAM+D,MAAOU,YAOzD,IAJAtE,KAAKM,SAASK,KAAKY,MACnBgD,OAAOvE,KAAMD,MAGN6D,OAAS,GACRU,WAAWV,OAAOtD,SAASC,OAASnB,KAAKC,aACzCD,KAAKoF,OAAOF,WAAYV,OACxBA,QAKRxE,KAAKqF,oBAAoB1E,KAAMuE,WAAYV,MAC/C,CAGA,MAAAY,CAAOF,WAAYV,OACf,MAAM5D,KAAOsE,WAAWV,OAClBb,EAAI/C,KAAKM,SAASC,OAClBmE,EAAItF,KAAKI,YAEfJ,KAAKuF,iBAAiB3E,KAAM0E,EAAG3B,GAE/B,MAAM6B,WAAaxF,KAAKyF,kBAAkB7E,KAAM0E,EAAG3B,GAE7C+B,QAAUtD,WAAWxB,KAAKM,SAAS2B,OAAO2C,WAAY5E,KAAKM,SAASC,OAASqE,aACnFE,QAAQ3D,OAASnB,KAAKmB,OACtB2D,QAAQpE,KAAOV,KAAKU,KAEpBsC,SAAShD,KAAMZ,KAAKe,QACpB6C,SAAS8B,QAAS1F,KAAKe,QAEnByD,MAAOU,WAAWV,MAAQ,GAAGtD,SAASK,KAAKmE,SAC1C1F,KAAKgC,WAAWpB,KAAM8E,QAC/B,CAEA,UAAA1D,CAAWpB,KAAM8E,SAEb1F,KAAKS,KAAO2B,WAAW,CAACxB,KAAM8E,UAC9B1F,KAAKS,KAAKsB,OAASnB,KAAKmB,OAAS,EACjC/B,KAAKS,KAAKa,MAAO,EACjBsC,SAAS5D,KAAKS,KAAMT,KAAKe,OAC7B,CAEA,iBAAA0E,CAAkB7E,KAAM0E,EAAG3B,GACvB,IAAIhB,MACAgD,WAAahB,IACbD,QAAUC,IAEd,IAAK,IAAI1D,EAAIqE,EAAGrE,GAAK0C,EAAI2B,EAAGrE,IAAK,CAC7B,MAAM2E,MAAQC,SAASjF,KAAM,EAAGK,EAAGjB,KAAKe,QAClC+E,MAAQD,SAASjF,KAAMK,EAAG0C,EAAG3D,KAAKe,QAElCgF,QAAUC,iBAAiBJ,MAAOE,OAClCjB,KAAOC,SAASc,OAASd,SAASgB,OAGpCC,QAAUJ,YACVA,WAAaI,QACbpD,MAAQ1B,EAERyD,QAAUG,KAAOH,QAAUG,KAAOH,SAE3BqB,UAAYJ,YAEfd,KAAOH,UACPA,QAAUG,KACVlC,MAAQ1B,EAGpB,CAEA,OAAO0B,OAASgB,EAAI2B,CACxB,CAGA,gBAAAC,CAAiB3E,KAAM0E,EAAG3B,GACtB,MAAMZ,YAAcnC,KAAKU,KAAOtB,KAAK+C,YAAckD,gBAC7C9C,YAAcvC,KAAKU,KAAOtB,KAAKmD,YAAc+C,gBACnClG,KAAKmG,eAAevF,KAAM0E,EAAG3B,EAAGZ,aAChC/C,KAAKmG,eAAevF,KAAM0E,EAAG3B,EAAGR,cAIzBvC,KAAKM,SAASkF,KAAKrD,YAC9C,CAGA,cAAAoD,CAAevF,KAAM0E,EAAG3B,EAAG0C,SACvBzF,KAAKM,SAASkF,KAAKC,SAEnB,MAAMtF,OAASf,KAAKe,OACduF,SAAWT,SAASjF,KAAM,EAAG0E,EAAGvE,QAChCwF,UAAYV,SAASjF,KAAM+C,EAAI2B,EAAG3B,EAAG5C,QAC3C,IAAIyF,OAASC,WAAWH,UAAYG,WAAWF,WAE/C,IAAK,IAAItF,EAAIqE,EAAGrE,EAAI0C,EAAI2B,EAAGrE,IAAK,CAC5B,MAAMG,MAAQR,KAAKM,SAASD,GAC5BkE,OAAOmB,SAAU1F,KAAKU,KAAOP,OAAOK,OAASA,OAC7CoF,QAAUC,WAAWH,SACzB,CAEA,IAAK,IAAIrF,EAAI0C,EAAI2B,EAAI,EAAGrE,GAAKqE,EAAGrE,IAAK,CACjC,MAAMG,MAAQR,KAAKM,SAASD,GAC5BkE,OAAOoB,UAAW3F,KAAKU,KAAOP,OAAOK,OAASA,OAC9CoF,QAAUC,WAAWF,UACzB,CAEA,OAAOC,MACX,CAEA,mBAAAnB,CAAoB1E,KAAM4B,KAAMiC,OAE5B,IAAK,IAAIvD,EAAIuD,MAAOvD,GAAK,EAAGA,IACxBkE,OAAO5C,KAAKtB,GAAIN,KAExB,CAEA,SAAAmC,CAAUP,MAEN,IAAK,IAAyBmE,SAArBzF,EAAIsB,KAAKpB,OAAS,EAAaF,GAAK,EAAGA,IACZ,IAA5BsB,KAAKtB,GAAGC,SAASC,OACbF,EAAI,GACJyF,SAAWnE,KAAKtB,EAAI,GAAGC,SACvBwF,SAAS7D,OAAO6D,SAASC,QAAQpE,KAAKtB,IAAK,IAExCjB,KAAKM,QAETsD,SAASrB,KAAKtB,GAAIjB,KAAKe,OAEtC,EAGJ,SAAS6B,SAAST,KAAMoB,MAAOjB,UAC3B,IAAKA,SAAU,OAAOiB,MAAMoD,QAAQxE,MAEpC,IAAK,IAAIlB,EAAI,EAAGA,EAAIsC,MAAMpC,OAAQF,IAC9B,GAAIqB,SAASH,KAAMoB,MAAMtC,IAAK,OAAOA,EAEzC,OAAO,CACX,CAGA,SAAS2C,SAAShD,KAAMG,QACpB8E,SAASjF,KAAM,EAAGA,KAAKM,SAASC,OAAQJ,OAAQH,KACpD,CAGA,SAASiF,SAASjF,KAAMgG,EAAGC,EAAG9F,OAAQ+F,UAC7BA,WAAUA,SAAW1E,WAAW,OACrC0E,SAAS5D,KAAOyB,IAChBmC,SAAS1D,KAAOuB,IAChBmC,SAASC,MAAO,IAChBD,SAASE,MAAO,IAEhB,IAAK,IAAI/F,EAAI2F,EAAG3F,EAAI4F,EAAG5F,IAAK,CACxB,MAAMG,MAAQR,KAAKM,SAASD,GAC5BkE,OAAO2B,SAAUlG,KAAKU,KAAOP,OAAOK,OAASA,MACjD,CAEA,OAAO0F,QACX,CAEA,SAAS3B,OAAOnC,EAAGC,GAKf,OAJAD,EAAEE,KAAOhD,KAAKkE,IAAIpB,EAAEE,KAAMD,EAAEC,MAC5BF,EAAEI,KAAOlD,KAAKkE,IAAIpB,EAAEI,KAAMH,EAAEG,MAC5BJ,EAAE+D,KAAO7G,KAAKC,IAAI6C,EAAE+D,KAAM9D,EAAE8D,MAC5B/D,EAAEgE,KAAO9G,KAAKC,IAAI6C,EAAEgE,KAAM/D,EAAE+D,MACrBhE,CACX,CAEA,SAASiD,gBAAgBjD,EAAGC,GAAK,OAAOD,EAAEE,KAAOD,EAAEC,IAAM,CACzD,SAASgD,gBAAgBlD,EAAGC,GAAK,OAAOD,EAAEI,KAAOH,EAAEG,IAAM,CAEzD,SAAS0B,SAAS9B,GAAO,OAAQA,EAAE+D,KAAO/D,EAAEE,OAASF,EAAEgE,KAAOhE,EAAEI,KAAO,CACvE,SAASqD,WAAWzD,GAAK,OAAQA,EAAE+D,KAAO/D,EAAEE,MAASF,EAAEgE,KAAOhE,EAAEI,KAAO,CAEvE,SAAS4B,aAAahC,EAAGC,GACrB,OAAQ/C,KAAKC,IAAI8C,EAAE8D,KAAM/D,EAAE+D,MAAQ7G,KAAKkE,IAAInB,EAAEC,KAAMF,EAAEE,QAC9ChD,KAAKC,IAAI8C,EAAE+D,KAAMhE,EAAEgE,MAAQ9G,KAAKkE,IAAInB,EAAEG,KAAMJ,EAAEI,MAC1D,CAEA,SAAS4C,iBAAiBhD,EAAGC,GACzB,MAAMC,KAAOhD,KAAKC,IAAI6C,EAAEE,KAAMD,EAAEC,MAC1BE,KAAOlD,KAAKC,IAAI6C,EAAEI,KAAMH,EAAEG,MAC1B2D,KAAO7G,KAAKkE,IAAIpB,EAAE+D,KAAM9D,EAAE8D,MAC1BC,KAAO9G,KAAKkE,IAAIpB,EAAEgE,KAAM/D,EAAE+D,MAEhC,OAAO9G,KAAKC,IAAI,EAAG4G,KAAO7D,MACnBhD,KAAKC,IAAI,EAAG6G,KAAO5D,KAC9B,CAEA,SAAS5B,SAASwB,EAAGC,GACjB,OAAOD,EAAEE,MAAQD,EAAEC,MACZF,EAAEI,MAAQH,EAAEG,MACZH,EAAE8D,MAAQ/D,EAAE+D,MACZ9D,EAAE+D,MAAQhE,EAAEgE,IACvB,CAEA,SAASlG,WAAWkC,EAAGC,GACnB,OAAOA,EAAEC,MAAQF,EAAE+D,MACZ9D,EAAEG,MAAQJ,EAAEgE,MACZ/D,EAAE8D,MAAQ/D,EAAEE,MACZD,EAAE+D,MAAQhE,EAAEI,IACvB,CAEA,SAAShB,WAAWlB,UAChB,MAAO,CACHA,kBACAa,OAAQ,EACRT,MAAM,EACN4B,KAAMyB,IACNvB,KAAMuB,IACNoC,MAAM,IACNC,MAAM,IAEd,CAKA,SAAS9C,YAAY+C,IAAKzD,KAAMC,MAAOyD,EAAGb,SACtC,MAAMc,MAAQ,CAAC3D,KAAMC,OAErB,KAAO0D,MAAMhG,QAAQ,CAIjB,IAHAsC,MAAQ0D,MAAM1F,QACd+B,KAAO2D,MAAM1F,QAEOyF,EAAG,SAEvB,MAAME,IAAM5D,KAAOtD,KAAKG,MAAMoD,MAAQD,MAAQ0D,EAAI,GAAKA,EACvDG,YAAYJ,IAAKG,IAAK5D,KAAMC,MAAO4C,SAEnCc,MAAM5F,KAAKiC,KAAM4D,IAAKA,IAAK3D,MAC/B,CACJ","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/rxjs/dist/esm5/internal/BehaviorSubject.js

@@ -0,0 +1,2 @@
+import{__extends}from"../../../../tslib/tslib.es6.js";import{Subject}from"./Subject.js";var BehaviorSubject=function(_super){function BehaviorSubject(_value){var _this=_super.call(this)||this;return _this._value=_value,_this}return __extends(BehaviorSubject,_super),Object.defineProperty(BehaviorSubject.prototype,"value",{get:function(){return this.getValue()},enumerable:!1,configurable:!0}),BehaviorSubject.prototype._subscribe=function(subscriber){var subscription=_super.prototype._subscribe.call(this,subscriber);return!subscription.closed&&subscriber.next(this._value),subscription},BehaviorSubject.prototype.getValue=function(){var _value=this._value;if(this.hasError)throw this.thrownError;return this._throwIfClosed(),_value},BehaviorSubject.prototype.next=function(value){_super.prototype.next.call(this,this._value=value)},BehaviorSubject}(Subject);export{BehaviorSubject};
+//# sourceMappingURL=BehaviorSubject.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/rxjs/dist/esm5/internal/BehaviorSubject.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BehaviorSubject.js","sources":["../../../../../../../../../../../../../node_modules/rxjs/dist/esm5/internal/BehaviorSubject.js"],"sourcesContent":["import { __extends } from \"tslib\";\nimport { Subject } from './Subject';\nvar BehaviorSubject = (function (_super) {\n    __extends(BehaviorSubject, _super);\n    function BehaviorSubject(_value) {\n        var _this = _super.call(this) || this;\n        _this._value = _value;\n        return _this;\n    }\n    Object.defineProperty(BehaviorSubject.prototype, \"value\", {\n        get: function () {\n            return this.getValue();\n        },\n        enumerable: false,\n        configurable: true\n    });\n    BehaviorSubject.prototype._subscribe = function (subscriber) {\n        var subscription = _super.prototype._subscribe.call(this, subscriber);\n        !subscription.closed && subscriber.next(this._value);\n        return subscription;\n    };\n    BehaviorSubject.prototype.getValue = function () {\n        var _a = this, hasError = _a.hasError, thrownError = _a.thrownError, _value = _a._value;\n        if (hasError) {\n            throw thrownError;\n        }\n        this._throwIfClosed();\n        return _value;\n    };\n    BehaviorSubject.prototype.next = function (value) {\n        _super.prototype.next.call(this, (this._value = value));\n    };\n    return BehaviorSubject;\n}(Subject));\nexport { BehaviorSubject };\n//# sourceMappingURL=BehaviorSubject.js.map"],"names":["BehaviorSubject","_super","_value","_this","call","this","__extends","Object","defineProperty","prototype","get","getValue","enumerable","configurable","_subscribe","subscriber","subscription","closed","next","hasError","thrownError","_throwIfClosed","value","Subject"],"mappings":"wFAEG,IAACA,gBAAmB,SAAUC,QAE7B,SAASD,gBAAgBE,QACrB,IAAIC,MAAQF,OAAOG,KAAKC,OAASA,KAEjC,OADAF,MAAMD,OAASA,OACRC,KACX,CAwBA,OA7BAG,UAAUN,gBAAiBC,QAM3BM,OAAOC,eAAeR,gBAAgBS,UAAW,QAAS,CACtDC,IAAK,WACD,OAAOL,KAAKM,UAChB,EACAC,YAAY,EACZC,cAAc,IAElBb,gBAAgBS,UAAUK,WAAa,SAAUC,YAC7C,IAAIC,aAAef,OAAOQ,UAAUK,WAAWV,KAAKC,KAAMU,YAE1D,OADCC,aAAaC,QAAUF,WAAWG,KAAKb,KAAKH,QACtCc,YACX,EACAhB,gBAAgBS,UAAUE,SAAW,WACjC,IAAqET,OAA5DG,KAAwEH,OACjF,GADSG,KAAoBc,SAEzB,MAFKd,KAA+Ce,YAKxD,OADAf,KAAKgB,iBACEnB,MACX,EACAF,gBAAgBS,UAAUS,KAAO,SAAUI,OACvCrB,OAAOQ,UAAUS,KAAKd,KAAKC,KAAOA,KAAKH,OAASoB,MACpD,EACOtB,eACX,CA/BmB,CA+BjBuB","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/rxjs/dist/esm5/internal/Observable.js

@@ -0,0 +1,2 @@
+import{SafeSubscriber,Subscriber}from"./Subscriber.js";import{isSubscription}from"./Subscription.js";import{observable}from"./symbol/observable.js";import{pipeFromArray}from"./util/pipe.js";import{config}from"./config.js";import{isFunction}from"./util/isFunction.js";import{errorContext}from"./util/errorContext.js";var Observable=function(){function Observable(subscribe){subscribe&&(this._subscribe=subscribe)}return Observable.prototype.lift=function(operator){var observable=new Observable;return observable.source=this,observable.operator=operator,observable},Observable.prototype.subscribe=function(observerOrNext,error,complete){var value,_this=this,subscriber=(value=observerOrNext)&&value instanceof Subscriber||function(value){return value&&isFunction(value.next)&&isFunction(value.error)&&isFunction(value.complete)}(value)&&isSubscription(value)?observerOrNext:new SafeSubscriber(observerOrNext,error,complete);return errorContext(function(){var operator=_this.operator,source=_this.source;subscriber.add(operator?operator.call(subscriber,source):source?_this._subscribe(subscriber):_this._trySubscribe(subscriber))}),subscriber},Observable.prototype._trySubscribe=function(sink){try{return this._subscribe(sink)}catch(err){sink.error(err)}},Observable.prototype.forEach=function(next,promiseCtor){var _this=this;return new(promiseCtor=getPromiseCtor(promiseCtor))(function(resolve,reject){var subscriber=new SafeSubscriber({next:function(value){try{next(value)}catch(err){reject(err),subscriber.unsubscribe()}},error:reject,complete:resolve});_this.subscribe(subscriber)})},Observable.prototype._subscribe=function(subscriber){var _a;return null===(_a=this.source)||void 0===_a?void 0:_a.subscribe(subscriber)},Observable.prototype[observable]=function(){return this},Observable.prototype.pipe=function(){for(var operations=[],_i=0;_i<arguments.length;_i++)operations[_i]=arguments[_i];return pipeFromArray(operations)(this)},Observable.prototype.toPromise=function(promiseCtor){var _this=this;return new(promiseCtor=getPromiseCtor(promiseCtor))(function(resolve,reject){var value;_this.subscribe(function(x){return value=x},function(err){return reject(err)},function(){return resolve(value)})})},Observable.create=function(subscribe){return new Observable(subscribe)},Observable}();function getPromiseCtor(promiseCtor){var _a;return null!==(_a=null!=promiseCtor?promiseCtor:config.Promise)&&void 0!==_a?_a:Promise}export{Observable};
+//# sourceMappingURL=Observable.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/rxjs/dist/esm5/internal/Observable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Observable.js","sources":["../../../../../../../../../../../../../node_modules/rxjs/dist/esm5/internal/Observable.js"],"sourcesContent":["import { SafeSubscriber, Subscriber } from './Subscriber';\nimport { isSubscription } from './Subscription';\nimport { observable as Symbol_observable } from './symbol/observable';\nimport { pipeFromArray } from './util/pipe';\nimport { config } from './config';\nimport { isFunction } from './util/isFunction';\nimport { errorContext } from './util/errorContext';\nvar Observable = (function () {\n    function Observable(subscribe) {\n        if (subscribe) {\n            this._subscribe = subscribe;\n        }\n    }\n    Observable.prototype.lift = function (operator) {\n        var observable = new Observable();\n        observable.source = this;\n        observable.operator = operator;\n        return observable;\n    };\n    Observable.prototype.subscribe = function (observerOrNext, error, complete) {\n        var _this = this;\n        var subscriber = isSubscriber(observerOrNext) ? observerOrNext : new SafeSubscriber(observerOrNext, error, complete);\n        errorContext(function () {\n            var _a = _this, operator = _a.operator, source = _a.source;\n            subscriber.add(operator\n                ?\n                    operator.call(subscriber, source)\n                : source\n                    ?\n                        _this._subscribe(subscriber)\n                    :\n                        _this._trySubscribe(subscriber));\n        });\n        return subscriber;\n    };\n    Observable.prototype._trySubscribe = function (sink) {\n        try {\n            return this._subscribe(sink);\n        }\n        catch (err) {\n            sink.error(err);\n        }\n    };\n    Observable.prototype.forEach = function (next, promiseCtor) {\n        var _this = this;\n        promiseCtor = getPromiseCtor(promiseCtor);\n        return new promiseCtor(function (resolve, reject) {\n            var subscriber = new SafeSubscriber({\n                next: function (value) {\n                    try {\n                        next(value);\n                    }\n                    catch (err) {\n                        reject(err);\n                        subscriber.unsubscribe();\n                    }\n                },\n                error: reject,\n                complete: resolve,\n            });\n            _this.subscribe(subscriber);\n        });\n    };\n    Observable.prototype._subscribe = function (subscriber) {\n        var _a;\n        return (_a = this.source) === null || _a === void 0 ? void 0 : _a.subscribe(subscriber);\n    };\n    Observable.prototype[Symbol_observable] = function () {\n        return this;\n    };\n    Observable.prototype.pipe = function () {\n        var operations = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            operations[_i] = arguments[_i];\n        }\n        return pipeFromArray(operations)(this);\n    };\n    Observable.prototype.toPromise = function (promiseCtor) {\n        var _this = this;\n        promiseCtor = getPromiseCtor(promiseCtor);\n        return new promiseCtor(function (resolve, reject) {\n            var value;\n            _this.subscribe(function (x) { return (value = x); }, function (err) { return reject(err); }, function () { return resolve(value); });\n        });\n    };\n    Observable.create = function (subscribe) {\n        return new Observable(subscribe);\n    };\n    return Observable;\n}());\nexport { Observable };\nfunction getPromiseCtor(promiseCtor) {\n    var _a;\n    return (_a = promiseCtor !== null && promiseCtor !== void 0 ? promiseCtor : config.Promise) !== null && _a !== void 0 ? _a : Promise;\n}\nfunction isObserver(value) {\n    return value && isFunction(value.next) && isFunction(value.error) && isFunction(value.complete);\n}\nfunction isSubscriber(value) {\n    return (value && value instanceof Subscriber) || (isObserver(value) && isSubscription(value));\n}\n//# sourceMappingURL=Observable.js.map"],"names":["Observable","subscribe","this","_subscribe","prototype","lift","operator","observable","source","observerOrNext","error","complete","value","_this","subscriber","Subscriber","isFunction","next","isObserver","isSubscription","SafeSubscriber","errorContext","add","call","_trySubscribe","sink","err","forEach","promiseCtor","getPromiseCtor","resolve","reject","unsubscribe","_a","Symbol_observable","pipe","operations","_i","arguments","length","pipeFromArray","toPromise","x","create","config","Promise"],"mappings":"4TAOG,IAACA,WAAc,WACd,SAASA,WAAWC,WACZA,YACAC,KAAKC,WAAaF,UAE1B,CA4EA,OA3EAD,WAAWI,UAAUC,KAAO,SAAUC,UAClC,IAAIC,WAAa,IAAIP,WAGrB,OAFAO,WAAWC,OAASN,KACpBK,WAAWD,SAAWA,SACfC,UACX,EACAP,WAAWI,UAAUH,UAAY,SAAUQ,eAAgBC,MAAOC,UAC9D,IA8EcC,MA9EVC,MAAQX,KACRY,YA6EUF,MA7EgBH,iBA8EjBG,iBAAiBG,YAJtC,SAAoBH,OAChB,OAAOA,OAASI,WAAWJ,MAAMK,OAASD,WAAWJ,MAAMF,QAAUM,WAAWJ,MAAMD,SAC1F,CAEsDO,CAAWN,QAAUO,eAAeP,OA9ElCH,eAAiB,IAAIW,eAAeX,eAAgBC,MAAOC,UAY3G,OAXAU,aAAa,WACT,IAAgBf,SAAPO,MAAqBP,SAAUE,OAA/BK,MAA2CL,OACpDM,WAAWQ,IAAIhB,SAEPA,SAASiB,KAAKT,WAAYN,QAC5BA,OAEMK,MAAMV,WAAWW,YAEjBD,MAAMW,cAAcV,YACpC,GACOA,UACX,EACAd,WAAWI,UAAUoB,cAAgB,SAAUC,MAC3C,IACI,OAAOvB,KAAKC,WAAWsB,KAC3B,CACA,MAAOC,KACHD,KAAKf,MAAMgB,IACf,CACJ,EACA1B,WAAWI,UAAUuB,QAAU,SAAUV,KAAMW,aAC3C,IAAIf,MAAQX,KAEZ,OAAO,IADP0B,YAAcC,eAAeD,cACN,SAAUE,QAASC,QACtC,IAAIjB,WAAa,IAAIM,eAAe,CAChCH,KAAM,SAAUL,OACZ,IACIK,KAAKL,MACT,CACA,MAAOc,KACHK,OAAOL,KACPZ,WAAWkB,aACf,CACJ,EACAtB,MAAOqB,OACPpB,SAAUmB,UAEdjB,MAAMZ,UAAUa,WACpB,EACJ,EACAd,WAAWI,UAAUD,WAAa,SAAUW,YACxC,IAAImB,GACJ,OAA8B,QAAtBA,GAAK/B,KAAKM,cAA2B,IAAPyB,QAAgB,EAASA,GAAGhC,UAAUa,WAChF,EACAd,WAAWI,UAAU8B,YAAqB,WACtC,OAAOhC,IACX,EACAF,WAAWI,UAAU+B,KAAO,WAExB,IADA,IAAIC,WAAa,GACRC,GAAK,EAAGA,GAAKC,UAAUC,OAAQF,KACpCD,WAAWC,IAAMC,UAAUD,IAE/B,OAAOG,cAAcJ,WAAdI,CAA0BtC,KACrC,EACAF,WAAWI,UAAUqC,UAAY,SAAUb,aACvC,IAAIf,MAAQX,KAEZ,OAAO,IADP0B,YAAcC,eAAeD,cACN,SAAUE,QAASC,QACtC,IAAInB,MACJC,MAAMZ,UAAU,SAAUyC,GAAK,OAAQ9B,MAAQ8B,CAAI,EAAG,SAAUhB,KAAO,OAAOK,OAAOL,IAAM,EAAG,WAAc,OAAOI,QAAQlB,MAAQ,EACvI,EACJ,EACAZ,WAAW2C,OAAS,SAAU1C,WAC1B,OAAO,IAAID,WAAWC,UAC1B,EACOD,UACX,IAEA,SAAS6B,eAAeD,aACpB,IAAIK,GACJ,OAAgG,QAAxFA,GAAKL,kBAAiDA,YAAcgB,OAAOC,eAA4B,IAAPZ,GAAgBA,GAAKY,OACjI","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/rxjs/dist/esm5/internal/ReplaySubject.js

@@ -0,0 +1,2 @@
+import{__extends}from"../../../../tslib/tslib.es6.js";import{Subject}from"./Subject.js";import{dateTimestampProvider}from"./scheduler/dateTimestampProvider.js";var ReplaySubject=function(_super){function ReplaySubject(_bufferSize,_windowTime,_timestampProvider){void 0===_bufferSize&&(_bufferSize=1/0),void 0===_windowTime&&(_windowTime=1/0),void 0===_timestampProvider&&(_timestampProvider=dateTimestampProvider);var _this=_super.call(this)||this;return _this._bufferSize=_bufferSize,_this._windowTime=_windowTime,_this._timestampProvider=_timestampProvider,_this._buffer=[],_this._infiniteTimeWindow=!0,_this._infiniteTimeWindow=_windowTime===1/0,_this._bufferSize=Math.max(1,_bufferSize),_this._windowTime=Math.max(1,_windowTime),_this}return __extends(ReplaySubject,_super),ReplaySubject.prototype.next=function(value){var _a=this,_buffer=_a._buffer,_infiniteTimeWindow=_a._infiniteTimeWindow,_timestampProvider=_a._timestampProvider,_windowTime=_a._windowTime;_a.isStopped||(_buffer.push(value),!_infiniteTimeWindow&&_buffer.push(_timestampProvider.now()+_windowTime)),this._trimBuffer(),_super.prototype.next.call(this,value)},ReplaySubject.prototype._subscribe=function(subscriber){this._throwIfClosed(),this._trimBuffer();for(var subscription=this._innerSubscribe(subscriber),_infiniteTimeWindow=this._infiniteTimeWindow,copy=this._buffer.slice(),i=0;i<copy.length&&!subscriber.closed;i+=_infiniteTimeWindow?1:2)subscriber.next(copy[i]);return this._checkFinalizedStatuses(subscriber),subscription},ReplaySubject.prototype._trimBuffer=function(){var _bufferSize=this._bufferSize,_timestampProvider=this._timestampProvider,_buffer=this._buffer,_infiniteTimeWindow=this._infiniteTimeWindow,adjustedBufferSize=(_infiniteTimeWindow?1:2)*_bufferSize;if(_bufferSize<1/0&&adjustedBufferSize<_buffer.length&&_buffer.splice(0,_buffer.length-adjustedBufferSize),!_infiniteTimeWindow){for(var now=_timestampProvider.now(),last=0,i=1;i<_buffer.length&&_buffer[i]<=now;i+=2)last=i;last&&_buffer.splice(0,last+1)}},ReplaySubject}(Subject);export{ReplaySubject};
+//# sourceMappingURL=ReplaySubject.js.map