@windwalker-io/unicorn-next 0.1.19 → 0.1.21

package/dist/chunks/events.js

@@ -0,0 +1,270 @@
+//#region ../../../../node_modules/ts-mixer/dist/esm/index.js
+/**
+* Utility function that works like `Object.apply`, but copies getters and setters properly as well.  Additionally gives
+* the option to exclude properties by name.
+*/
+var copyProps = (dest, src, exclude = []) => {
+	const props = Object.getOwnPropertyDescriptors(src);
+	for (let prop of exclude) delete props[prop];
+	Object.defineProperties(dest, props);
+};
+/**
+* Returns the full chain of prototypes up until Object.prototype given a starting object.  The order of prototypes will
+* be closest to farthest in the chain.
+*/
+var protoChain = (obj, currentChain = [obj]) => {
+	const proto = Object.getPrototypeOf(obj);
+	if (proto === null) return currentChain;
+	return protoChain(proto, [...currentChain, proto]);
+};
+/**
+* Identifies the nearest ancestor common to all the given objects in their prototype chains.  For most unrelated
+* objects, this function should return Object.prototype.
+*/
+var nearestCommonProto = (...objs) => {
+	if (objs.length === 0) return void 0;
+	let commonProto = void 0;
+	const protoChains = objs.map((obj) => protoChain(obj));
+	while (protoChains.every((protoChain) => protoChain.length > 0)) {
+		const protos = protoChains.map((protoChain) => protoChain.pop());
+		const potentialCommonProto = protos[0];
+		if (protos.every((proto) => proto === potentialCommonProto)) commonProto = potentialCommonProto;
+		else break;
+	}
+	return commonProto;
+};
+/**
+* Creates a new prototype object that is a mixture of the given prototypes.  The mixing is achieved by first
+* identifying the nearest common ancestor and using it as the prototype for a new object.  Then all properties/methods
+* downstream of this prototype (ONLY downstream) are copied into the new object.
+*
+* The resulting prototype is more performant than softMixProtos(...), as well as ES5 compatible.  However, it's not as
+* flexible as updates to the source prototypes aren't captured by the mixed result.  See softMixProtos for why you may
+* want to use that instead.
+*/
+var hardMixProtos = (ingredients, constructor, exclude = []) => {
+	var _a;
+	const base = (_a = nearestCommonProto(...ingredients)) !== null && _a !== void 0 ? _a : Object.prototype;
+	const mixedProto = Object.create(base);
+	const visitedProtos = protoChain(base);
+	for (let prototype of ingredients) {
+		let protos = protoChain(prototype);
+		for (let i = protos.length - 1; i >= 0; i--) {
+			let newProto = protos[i];
+			if (visitedProtos.indexOf(newProto) === -1) {
+				copyProps(mixedProto, newProto, ["constructor", ...exclude]);
+				visitedProtos.push(newProto);
+			}
+		}
+	}
+	mixedProto.constructor = constructor;
+	return mixedProto;
+};
+var unique = (arr) => arr.filter((e, i) => arr.indexOf(e) == i);
+/**
+* Finds the ingredient with the given prop, searching in reverse order and breadth-first if searching ingredient
+* prototypes is required.
+*/
+var getIngredientWithProp = (prop, ingredients) => {
+	const protoChains = ingredients.map((ingredient) => protoChain(ingredient));
+	let protoDepth = 0;
+	let protosAreLeftToSearch = true;
+	while (protosAreLeftToSearch) {
+		protosAreLeftToSearch = false;
+		for (let i = ingredients.length - 1; i >= 0; i--) {
+			const searchTarget = protoChains[i][protoDepth];
+			if (searchTarget !== void 0 && searchTarget !== null) {
+				protosAreLeftToSearch = true;
+				if (Object.getOwnPropertyDescriptor(searchTarget, prop) != void 0) return protoChains[i][0];
+			}
+		}
+		protoDepth++;
+	}
+};
+/**
+* "Mixes" ingredients by wrapping them in a Proxy.  The optional prototype argument allows the mixed object to sit
+* downstream of an existing prototype chain.  Note that "properties" cannot be added, deleted, or modified.
+*/
+var proxyMix = (ingredients, prototype = Object.prototype) => new Proxy({}, {
+	getPrototypeOf() {
+		return prototype;
+	},
+	setPrototypeOf() {
+		throw Error("Cannot set prototype of Proxies created by ts-mixer");
+	},
+	getOwnPropertyDescriptor(_, prop) {
+		return Object.getOwnPropertyDescriptor(getIngredientWithProp(prop, ingredients) || {}, prop);
+	},
+	defineProperty() {
+		throw new Error("Cannot define new properties on Proxies created by ts-mixer");
+	},
+	has(_, prop) {
+		return getIngredientWithProp(prop, ingredients) !== void 0 || prototype[prop] !== void 0;
+	},
+	get(_, prop) {
+		return (getIngredientWithProp(prop, ingredients) || prototype)[prop];
+	},
+	set(_, prop, val) {
+		const ingredientWithProp = getIngredientWithProp(prop, ingredients);
+		if (ingredientWithProp === void 0) throw new Error("Cannot set new properties on Proxies created by ts-mixer");
+		ingredientWithProp[prop] = val;
+		return true;
+	},
+	deleteProperty() {
+		throw new Error("Cannot delete properties on Proxies created by ts-mixer");
+	},
+	ownKeys() {
+		return ingredients.map(Object.getOwnPropertyNames).reduce((prev, curr) => curr.concat(prev.filter((key) => curr.indexOf(key) < 0)));
+	}
+});
+/**
+* Creates a new proxy-prototype object that is a "soft" mixture of the given prototypes.  The mixing is achieved by
+* proxying all property access to the ingredients.  This is not ES5 compatible and less performant.  However, any
+* changes made to the source prototypes will be reflected in the proxy-prototype, which may be desirable.
+*/
+var softMixProtos = (ingredients, constructor) => proxyMix([...ingredients, { constructor }]);
+var settings = {
+	initFunction: null,
+	staticsStrategy: "copy",
+	prototypeStrategy: "copy",
+	decoratorInheritance: "deep"
+};
+var mixins = /* @__PURE__ */ new WeakMap();
+var getMixinsForClass = (clazz) => mixins.get(clazz);
+var registerMixins = (mixedClass, constituents) => mixins.set(mixedClass, constituents);
+var mergeObjectsOfDecorators = (o1, o2) => {
+	var _a, _b;
+	const allKeys = unique([...Object.getOwnPropertyNames(o1), ...Object.getOwnPropertyNames(o2)]);
+	const mergedObject = {};
+	for (let key of allKeys) mergedObject[key] = unique([...(_a = o1 === null || o1 === void 0 ? void 0 : o1[key]) !== null && _a !== void 0 ? _a : [], ...(_b = o2 === null || o2 === void 0 ? void 0 : o2[key]) !== null && _b !== void 0 ? _b : []]);
+	return mergedObject;
+};
+var mergePropertyAndMethodDecorators = (d1, d2) => {
+	var _a, _b, _c, _d;
+	return {
+		property: mergeObjectsOfDecorators((_a = d1 === null || d1 === void 0 ? void 0 : d1.property) !== null && _a !== void 0 ? _a : {}, (_b = d2 === null || d2 === void 0 ? void 0 : d2.property) !== null && _b !== void 0 ? _b : {}),
+		method: mergeObjectsOfDecorators((_c = d1 === null || d1 === void 0 ? void 0 : d1.method) !== null && _c !== void 0 ? _c : {}, (_d = d2 === null || d2 === void 0 ? void 0 : d2.method) !== null && _d !== void 0 ? _d : {})
+	};
+};
+var mergeDecorators = (d1, d2) => {
+	var _a, _b, _c, _d, _e, _f;
+	return {
+		class: unique([...(_a = d1 === null || d1 === void 0 ? void 0 : d1.class) !== null && _a !== void 0 ? _a : [], ...(_b = d2 === null || d2 === void 0 ? void 0 : d2.class) !== null && _b !== void 0 ? _b : []]),
+		static: mergePropertyAndMethodDecorators((_c = d1 === null || d1 === void 0 ? void 0 : d1.static) !== null && _c !== void 0 ? _c : {}, (_d = d2 === null || d2 === void 0 ? void 0 : d2.static) !== null && _d !== void 0 ? _d : {}),
+		instance: mergePropertyAndMethodDecorators((_e = d1 === null || d1 === void 0 ? void 0 : d1.instance) !== null && _e !== void 0 ? _e : {}, (_f = d2 === null || d2 === void 0 ? void 0 : d2.instance) !== null && _f !== void 0 ? _f : {})
+	};
+};
+var decorators = /* @__PURE__ */ new Map();
+var findAllConstituentClasses = (...classes) => {
+	var _a;
+	const allClasses = /* @__PURE__ */ new Set();
+	const frontier = new Set([...classes]);
+	while (frontier.size > 0) for (let clazz of frontier) {
+		const protoChainClasses = protoChain(clazz.prototype).map((proto) => proto.constructor);
+		const mixinClasses = (_a = getMixinsForClass(clazz)) !== null && _a !== void 0 ? _a : [];
+		const newClasses = [...protoChainClasses, ...mixinClasses].filter((c) => !allClasses.has(c));
+		for (let newClass of newClasses) frontier.add(newClass);
+		allClasses.add(clazz);
+		frontier.delete(clazz);
+	}
+	return [...allClasses];
+};
+var deepDecoratorSearch = (...classes) => {
+	const decoratorsForClassChain = findAllConstituentClasses(...classes).map((clazz) => decorators.get(clazz)).filter((decorators) => !!decorators);
+	if (decoratorsForClassChain.length == 0) return {};
+	if (decoratorsForClassChain.length == 1) return decoratorsForClassChain[0];
+	return decoratorsForClassChain.reduce((d1, d2) => mergeDecorators(d1, d2));
+};
+var directDecoratorSearch = (...classes) => {
+	const classDecorators = classes.map((clazz) => getDecoratorsForClass(clazz));
+	if (classDecorators.length === 0) return {};
+	if (classDecorators.length === 1) return classDecorators[0];
+	return classDecorators.reduce((d1, d2) => mergeDecorators(d1, d2));
+};
+var getDecoratorsForClass = (clazz) => {
+	let decoratorsForClass = decorators.get(clazz);
+	if (!decoratorsForClass) {
+		decoratorsForClass = {};
+		decorators.set(clazz, decoratorsForClass);
+	}
+	return decoratorsForClass;
+};
+function Mixin(...constructors) {
+	var _a, _b, _c;
+	const prototypes = constructors.map((constructor) => constructor.prototype);
+	const initFunctionName = settings.initFunction;
+	if (initFunctionName !== null) {
+		const initFunctions = prototypes.map((proto) => proto[initFunctionName]).filter((func) => typeof func === "function");
+		const combinedInitFunction = function(...args) {
+			for (let initFunction of initFunctions) initFunction.apply(this, args);
+		};
+		const extraProto = { [initFunctionName]: combinedInitFunction };
+		prototypes.push(extraProto);
+	}
+	function MixedClass(...args) {
+		for (const constructor of constructors) copyProps(this, new constructor(...args));
+		if (initFunctionName !== null && typeof this[initFunctionName] === "function") this[initFunctionName].apply(this, args);
+	}
+	MixedClass.prototype = settings.prototypeStrategy === "copy" ? hardMixProtos(prototypes, MixedClass) : softMixProtos(prototypes, MixedClass);
+	Object.setPrototypeOf(MixedClass, settings.staticsStrategy === "copy" ? hardMixProtos(constructors, null, ["prototype"]) : proxyMix(constructors, Function.prototype));
+	let DecoratedMixedClass = MixedClass;
+	if (settings.decoratorInheritance !== "none") {
+		const classDecorators = settings.decoratorInheritance === "deep" ? deepDecoratorSearch(...constructors) : directDecoratorSearch(...constructors);
+		for (let decorator of (_a = classDecorators === null || classDecorators === void 0 ? void 0 : classDecorators.class) !== null && _a !== void 0 ? _a : []) {
+			const result = decorator(DecoratedMixedClass);
+			if (result) DecoratedMixedClass = result;
+		}
+		applyPropAndMethodDecorators((_b = classDecorators === null || classDecorators === void 0 ? void 0 : classDecorators.static) !== null && _b !== void 0 ? _b : {}, DecoratedMixedClass);
+		applyPropAndMethodDecorators((_c = classDecorators === null || classDecorators === void 0 ? void 0 : classDecorators.instance) !== null && _c !== void 0 ? _c : {}, DecoratedMixedClass.prototype);
+	}
+	registerMixins(DecoratedMixedClass, constructors);
+	return DecoratedMixedClass;
+}
+var applyPropAndMethodDecorators = (propAndMethodDecorators, target) => {
+	const propDecorators = propAndMethodDecorators.property;
+	const methodDecorators = propAndMethodDecorators.method;
+	if (propDecorators) for (let key in propDecorators) for (let decorator of propDecorators[key]) decorator(target, key);
+	if (methodDecorators) for (let key in methodDecorators) for (let decorator of methodDecorators[key]) decorator(target, key, Object.getOwnPropertyDescriptor(target, key));
+};
+//#endregion
+//#region src/events.ts
+var EventMixin = class {
+	_listeners = {};
+	on(event, handler) {
+		if (Array.isArray(event)) {
+			for (const e of event) this.on(e, handler);
+			return this;
+		}
+		this._listeners[event] ??= [];
+		this._listeners[event].push(handler);
+		return this;
+	}
+	once(event, handler) {
+		handler.once = true;
+		return this.on(event, handler);
+	}
+	off(event, handler) {
+		if (handler) {
+			this._listeners[event] = this.listeners(event).filter((listener) => listener !== handler);
+			return this;
+		}
+		delete this._listeners[event];
+		return this;
+	}
+	trigger(event, ...args) {
+		if (Array.isArray(event)) {
+			for (const e of event) this.trigger(e);
+			return this;
+		}
+		for (const listener of this.listeners(event)) listener(...args);
+		this._listeners[event] = this.listeners(event).filter((listener) => listener?.once !== true);
+		return this;
+	}
+	listeners(event) {
+		return this._listeners[event] === void 0 ? [] : this._listeners[event];
+	}
+};
+//#endregion
+export { Mixin as n, EventMixin as t };
+
+//# sourceMappingURL=events.js.map

package/dist/chunks/events.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"events.js","names":[],"sources":["../../../../../../node_modules/ts-mixer/dist/esm/index.js","../../src/events.ts"],"sourcesContent":["/**\n * Utility function that works like `Object.apply`, but copies getters and setters properly as well.  Additionally gives\n * the option to exclude properties by name.\n */\nconst copyProps = (dest, src, exclude = []) => {\n    const props = Object.getOwnPropertyDescriptors(src);\n    for (let prop of exclude)\n        delete props[prop];\n    Object.defineProperties(dest, props);\n};\n/**\n * Returns the full chain of prototypes up until Object.prototype given a starting object.  The order of prototypes will\n * be closest to farthest in the chain.\n */\nconst protoChain = (obj, currentChain = [obj]) => {\n    const proto = Object.getPrototypeOf(obj);\n    if (proto === null)\n        return currentChain;\n    return protoChain(proto, [...currentChain, proto]);\n};\n/**\n * Identifies the nearest ancestor common to all the given objects in their prototype chains.  For most unrelated\n * objects, this function should return Object.prototype.\n */\nconst nearestCommonProto = (...objs) => {\n    if (objs.length === 0)\n        return undefined;\n    let commonProto = undefined;\n    const protoChains = objs.map(obj => protoChain(obj));\n    while (protoChains.every(protoChain => protoChain.length > 0)) {\n        const protos = protoChains.map(protoChain => protoChain.pop());\n        const potentialCommonProto = protos[0];\n        if (protos.every(proto => proto === potentialCommonProto))\n            commonProto = potentialCommonProto;\n        else\n            break;\n    }\n    return commonProto;\n};\n/**\n * Creates a new prototype object that is a mixture of the given prototypes.  The mixing is achieved by first\n * identifying the nearest common ancestor and using it as the prototype for a new object.  Then all properties/methods\n * downstream of this prototype (ONLY downstream) are copied into the new object.\n *\n * The resulting prototype is more performant than softMixProtos(...), as well as ES5 compatible.  However, it's not as\n * flexible as updates to the source prototypes aren't captured by the mixed result.  See softMixProtos for why you may\n * want to use that instead.\n */\nconst hardMixProtos = (ingredients, constructor, exclude = []) => {\n    var _a;\n    const base = (_a = nearestCommonProto(...ingredients)) !== null && _a !== void 0 ? _a : Object.prototype;\n    const mixedProto = Object.create(base);\n    // Keeps track of prototypes we've already visited to avoid copying the same properties multiple times.  We init the\n    // list with the proto chain below the nearest common ancestor because we don't want any of those methods mixed in\n    // when they will already be accessible via prototype access.\n    const visitedProtos = protoChain(base);\n    for (let prototype of ingredients) {\n        let protos = protoChain(prototype);\n        // Apply the prototype chain in reverse order so that old methods don't override newer ones.\n        for (let i = protos.length - 1; i >= 0; i--) {\n            let newProto = protos[i];\n            if (visitedProtos.indexOf(newProto) === -1) {\n                copyProps(mixedProto, newProto, ['constructor', ...exclude]);\n                visitedProtos.push(newProto);\n            }\n        }\n    }\n    mixedProto.constructor = constructor;\n    return mixedProto;\n};\nconst unique = (arr) => arr.filter((e, i) => arr.indexOf(e) == i);\n\n/**\n * Finds the ingredient with the given prop, searching in reverse order and breadth-first if searching ingredient\n * prototypes is required.\n */\nconst getIngredientWithProp = (prop, ingredients) => {\n    const protoChains = ingredients.map(ingredient => protoChain(ingredient));\n    // since we search breadth-first, we need to keep track of our depth in the prototype chains\n    let protoDepth = 0;\n    // not all prototype chains are the same depth, so this remains true as long as at least one of the ingredients'\n    // prototype chains has an object at this depth\n    let protosAreLeftToSearch = true;\n    while (protosAreLeftToSearch) {\n        // with the start of each horizontal slice, we assume this is the one that's deeper than any of the proto chains\n        protosAreLeftToSearch = false;\n        // scan through the ingredients right to left\n        for (let i = ingredients.length - 1; i >= 0; i--) {\n            const searchTarget = protoChains[i][protoDepth];\n            if (searchTarget !== undefined && searchTarget !== null) {\n                // if we find something, this is proof that this horizontal slice potentially more objects to search\n                protosAreLeftToSearch = true;\n                // eureka, we found it\n                if (Object.getOwnPropertyDescriptor(searchTarget, prop) != undefined) {\n                    return protoChains[i][0];\n                }\n            }\n        }\n        protoDepth++;\n    }\n    return undefined;\n};\n/**\n * \"Mixes\" ingredients by wrapping them in a Proxy.  The optional prototype argument allows the mixed object to sit\n * downstream of an existing prototype chain.  Note that \"properties\" cannot be added, deleted, or modified.\n */\nconst proxyMix = (ingredients, prototype = Object.prototype) => new Proxy({}, {\n    getPrototypeOf() {\n        return prototype;\n    },\n    setPrototypeOf() {\n        throw Error('Cannot set prototype of Proxies created by ts-mixer');\n    },\n    getOwnPropertyDescriptor(_, prop) {\n        return Object.getOwnPropertyDescriptor(getIngredientWithProp(prop, ingredients) || {}, prop);\n    },\n    defineProperty() {\n        throw new Error('Cannot define new properties on Proxies created by ts-mixer');\n    },\n    has(_, prop) {\n        return getIngredientWithProp(prop, ingredients) !== undefined || prototype[prop] !== undefined;\n    },\n    get(_, prop) {\n        return (getIngredientWithProp(prop, ingredients) || prototype)[prop];\n    },\n    set(_, prop, val) {\n        const ingredientWithProp = getIngredientWithProp(prop, ingredients);\n        if (ingredientWithProp === undefined)\n            throw new Error('Cannot set new properties on Proxies created by ts-mixer');\n        ingredientWithProp[prop] = val;\n        return true;\n    },\n    deleteProperty() {\n        throw new Error('Cannot delete properties on Proxies created by ts-mixer');\n    },\n    ownKeys() {\n        return ingredients\n            .map(Object.getOwnPropertyNames)\n            .reduce((prev, curr) => curr.concat(prev.filter(key => curr.indexOf(key) < 0)));\n    },\n});\n/**\n * Creates a new proxy-prototype object that is a \"soft\" mixture of the given prototypes.  The mixing is achieved by\n * proxying all property access to the ingredients.  This is not ES5 compatible and less performant.  However, any\n * changes made to the source prototypes will be reflected in the proxy-prototype, which may be desirable.\n */\nconst softMixProtos = (ingredients, constructor) => proxyMix([...ingredients, { constructor }]);\n\nconst settings = {\n    initFunction: null,\n    staticsStrategy: 'copy',\n    prototypeStrategy: 'copy',\n    decoratorInheritance: 'deep',\n};\n\n// Keeps track of constituent classes for every mixin class created by ts-mixer.\nconst mixins = new WeakMap();\nconst getMixinsForClass = (clazz) => mixins.get(clazz);\nconst registerMixins = (mixedClass, constituents) => mixins.set(mixedClass, constituents);\nconst hasMixin = (instance, mixin) => {\n    if (instance instanceof mixin)\n        return true;\n    const constructor = instance.constructor;\n    const visited = new Set();\n    let frontier = new Set();\n    frontier.add(constructor);\n    while (frontier.size > 0) {\n        // check if the frontier has the mixin we're looking for.  if not, we can say we visited every item in the frontier\n        if (frontier.has(mixin))\n            return true;\n        frontier.forEach((item) => visited.add(item));\n        // build a new frontier based on the associated mixin classes and prototype chains of each frontier item\n        const newFrontier = new Set();\n        frontier.forEach((item) => {\n            var _a;\n            const itemConstituents = (_a = mixins.get(item)) !== null && _a !== void 0 ? _a : protoChain(item.prototype)\n                .map((proto) => proto.constructor)\n                .filter((item) => item !== null);\n            if (itemConstituents)\n                itemConstituents.forEach((constituent) => {\n                    if (!visited.has(constituent) && !frontier.has(constituent))\n                        newFrontier.add(constituent);\n                });\n        });\n        // we have a new frontier, now search again\n        frontier = newFrontier;\n    }\n    // if we get here, we couldn't find the mixin anywhere in the prototype chain or associated mixin classes\n    return false;\n};\n\nconst mergeObjectsOfDecorators = (o1, o2) => {\n    var _a, _b;\n    const allKeys = unique([...Object.getOwnPropertyNames(o1), ...Object.getOwnPropertyNames(o2)]);\n    const mergedObject = {};\n    for (let key of allKeys)\n        mergedObject[key] = unique([...((_a = o1 === null || o1 === void 0 ? void 0 : o1[key]) !== null && _a !== void 0 ? _a : []), ...((_b = o2 === null || o2 === void 0 ? void 0 : o2[key]) !== null && _b !== void 0 ? _b : [])]);\n    return mergedObject;\n};\nconst mergePropertyAndMethodDecorators = (d1, d2) => {\n    var _a, _b, _c, _d;\n    return ({\n        property: mergeObjectsOfDecorators((_a = d1 === null || d1 === void 0 ? void 0 : d1.property) !== null && _a !== void 0 ? _a : {}, (_b = d2 === null || d2 === void 0 ? void 0 : d2.property) !== null && _b !== void 0 ? _b : {}),\n        method: mergeObjectsOfDecorators((_c = d1 === null || d1 === void 0 ? void 0 : d1.method) !== null && _c !== void 0 ? _c : {}, (_d = d2 === null || d2 === void 0 ? void 0 : d2.method) !== null && _d !== void 0 ? _d : {}),\n    });\n};\nconst mergeDecorators = (d1, d2) => {\n    var _a, _b, _c, _d, _e, _f;\n    return ({\n        class: unique([...(_a = d1 === null || d1 === void 0 ? void 0 : d1.class) !== null && _a !== void 0 ? _a : [], ...(_b = d2 === null || d2 === void 0 ? void 0 : d2.class) !== null && _b !== void 0 ? _b : []]),\n        static: mergePropertyAndMethodDecorators((_c = d1 === null || d1 === void 0 ? void 0 : d1.static) !== null && _c !== void 0 ? _c : {}, (_d = d2 === null || d2 === void 0 ? void 0 : d2.static) !== null && _d !== void 0 ? _d : {}),\n        instance: mergePropertyAndMethodDecorators((_e = d1 === null || d1 === void 0 ? void 0 : d1.instance) !== null && _e !== void 0 ? _e : {}, (_f = d2 === null || d2 === void 0 ? void 0 : d2.instance) !== null && _f !== void 0 ? _f : {}),\n    });\n};\nconst decorators = new Map();\nconst findAllConstituentClasses = (...classes) => {\n    var _a;\n    const allClasses = new Set();\n    const frontier = new Set([...classes]);\n    while (frontier.size > 0) {\n        for (let clazz of frontier) {\n            const protoChainClasses = protoChain(clazz.prototype).map(proto => proto.constructor);\n            const mixinClasses = (_a = getMixinsForClass(clazz)) !== null && _a !== void 0 ? _a : [];\n            const potentiallyNewClasses = [...protoChainClasses, ...mixinClasses];\n            const newClasses = potentiallyNewClasses.filter(c => !allClasses.has(c));\n            for (let newClass of newClasses)\n                frontier.add(newClass);\n            allClasses.add(clazz);\n            frontier.delete(clazz);\n        }\n    }\n    return [...allClasses];\n};\nconst deepDecoratorSearch = (...classes) => {\n    const decoratorsForClassChain = findAllConstituentClasses(...classes)\n        .map(clazz => decorators.get(clazz))\n        .filter(decorators => !!decorators);\n    if (decoratorsForClassChain.length == 0)\n        return {};\n    if (decoratorsForClassChain.length == 1)\n        return decoratorsForClassChain[0];\n    return decoratorsForClassChain.reduce((d1, d2) => mergeDecorators(d1, d2));\n};\nconst directDecoratorSearch = (...classes) => {\n    const classDecorators = classes.map(clazz => getDecoratorsForClass(clazz));\n    if (classDecorators.length === 0)\n        return {};\n    if (classDecorators.length === 1)\n        return classDecorators[0];\n    return classDecorators.reduce((d1, d2) => mergeDecorators(d1, d2));\n};\nconst getDecoratorsForClass = (clazz) => {\n    let decoratorsForClass = decorators.get(clazz);\n    if (!decoratorsForClass) {\n        decoratorsForClass = {};\n        decorators.set(clazz, decoratorsForClass);\n    }\n    return decoratorsForClass;\n};\nconst decorateClass = (decorator) => ((clazz) => {\n    const decoratorsForClass = getDecoratorsForClass(clazz);\n    let classDecorators = decoratorsForClass.class;\n    if (!classDecorators) {\n        classDecorators = [];\n        decoratorsForClass.class = classDecorators;\n    }\n    classDecorators.push(decorator);\n    return decorator(clazz);\n});\nconst decorateMember = (decorator) => ((object, key, ...otherArgs) => {\n    var _a, _b, _c;\n    const decoratorTargetType = typeof object === 'function' ? 'static' : 'instance';\n    const decoratorType = typeof object[key] === 'function' ? 'method' : 'property';\n    const clazz = decoratorTargetType === 'static' ? object : object.constructor;\n    const decoratorsForClass = getDecoratorsForClass(clazz);\n    const decoratorsForTargetType = (_a = decoratorsForClass === null || decoratorsForClass === void 0 ? void 0 : decoratorsForClass[decoratorTargetType]) !== null && _a !== void 0 ? _a : {};\n    decoratorsForClass[decoratorTargetType] = decoratorsForTargetType;\n    let decoratorsForType = (_b = decoratorsForTargetType === null || decoratorsForTargetType === void 0 ? void 0 : decoratorsForTargetType[decoratorType]) !== null && _b !== void 0 ? _b : {};\n    decoratorsForTargetType[decoratorType] = decoratorsForType;\n    let decoratorsForKey = (_c = decoratorsForType === null || decoratorsForType === void 0 ? void 0 : decoratorsForType[key]) !== null && _c !== void 0 ? _c : [];\n    decoratorsForType[key] = decoratorsForKey;\n    // @ts-ignore: array is type `A[] | B[]` and item is type `A | B`, so technically a type error, but it's fine\n    decoratorsForKey.push(decorator);\n    // @ts-ignore\n    return decorator(object, key, ...otherArgs);\n});\nconst decorate = (decorator) => ((...args) => {\n    if (args.length === 1)\n        return decorateClass(decorator)(args[0]);\n    return decorateMember(decorator)(...args);\n});\n\nfunction Mixin(...constructors) {\n    var _a, _b, _c;\n    const prototypes = constructors.map(constructor => constructor.prototype);\n    // Here we gather up the init functions of the ingredient prototypes, combine them into one init function, and\n    // attach it to the mixed class prototype.  The reason we do this is because we want the init functions to mix\n    // similarly to constructors -- not methods, which simply override each other.\n    const initFunctionName = settings.initFunction;\n    if (initFunctionName !== null) {\n        const initFunctions = prototypes\n            .map(proto => proto[initFunctionName])\n            .filter(func => typeof func === 'function');\n        const combinedInitFunction = function (...args) {\n            for (let initFunction of initFunctions)\n                initFunction.apply(this, args);\n        };\n        const extraProto = { [initFunctionName]: combinedInitFunction };\n        prototypes.push(extraProto);\n    }\n    function MixedClass(...args) {\n        for (const constructor of constructors)\n            // @ts-ignore: potentially abstract class\n            copyProps(this, new constructor(...args));\n        if (initFunctionName !== null && typeof this[initFunctionName] === 'function')\n            this[initFunctionName].apply(this, args);\n    }\n    MixedClass.prototype = settings.prototypeStrategy === 'copy'\n        ? hardMixProtos(prototypes, MixedClass)\n        : softMixProtos(prototypes, MixedClass);\n    Object.setPrototypeOf(MixedClass, settings.staticsStrategy === 'copy'\n        ? hardMixProtos(constructors, null, ['prototype'])\n        : proxyMix(constructors, Function.prototype));\n    let DecoratedMixedClass = MixedClass;\n    if (settings.decoratorInheritance !== 'none') {\n        const classDecorators = settings.decoratorInheritance === 'deep'\n            ? deepDecoratorSearch(...constructors)\n            : directDecoratorSearch(...constructors);\n        for (let decorator of (_a = classDecorators === null || classDecorators === void 0 ? void 0 : classDecorators.class) !== null && _a !== void 0 ? _a : []) {\n            const result = decorator(DecoratedMixedClass);\n            if (result) {\n                DecoratedMixedClass = result;\n            }\n        }\n        applyPropAndMethodDecorators((_b = classDecorators === null || classDecorators === void 0 ? void 0 : classDecorators.static) !== null && _b !== void 0 ? _b : {}, DecoratedMixedClass);\n        applyPropAndMethodDecorators((_c = classDecorators === null || classDecorators === void 0 ? void 0 : classDecorators.instance) !== null && _c !== void 0 ? _c : {}, DecoratedMixedClass.prototype);\n    }\n    registerMixins(DecoratedMixedClass, constructors);\n    return DecoratedMixedClass;\n}\nconst applyPropAndMethodDecorators = (propAndMethodDecorators, target) => {\n    const propDecorators = propAndMethodDecorators.property;\n    const methodDecorators = propAndMethodDecorators.method;\n    if (propDecorators)\n        for (let key in propDecorators)\n            for (let decorator of propDecorators[key])\n                decorator(target, key);\n    if (methodDecorators)\n        for (let key in methodDecorators)\n            for (let decorator of methodDecorators[key])\n                decorator(target, key, Object.getOwnPropertyDescriptor(target, key));\n};\n/**\n * A decorator version of the `Mixin` function.  You'll want to use this instead of `Mixin` for mixing generic classes.\n */\nconst mix = (...ingredients) => decoratedClass => {\n    // @ts-ignore\n    const mixedClass = Mixin(...ingredients.concat([decoratedClass]));\n    Object.defineProperty(mixedClass, 'name', {\n        value: decoratedClass.name,\n        writable: false,\n    });\n    return mixedClass;\n};\n\nexport { Mixin, decorate, hasMixin, mix, settings };\n","export abstract class EventMixin implements EventAwareInterface {\n  _listeners: Record<string, EventHandler[]> = {};\n\n  on<T extends any[]>(event: string, handler: EventHandler<T>): this;\n  on(event: string | string[], handler: EventHandler): this;\n  on(event: string | string[], handler: EventHandler): this {\n    if (Array.isArray(event)) {\n      for (const e of event) {\n        this.on(e, handler);\n      }\n      return this;\n    }\n\n    this._listeners[event] ??= [];\n\n    this._listeners[event].push(handler);\n\n    return this;\n  }\n\n  once<T extends any[]>(event: string, handler: EventHandler<T>): this;\n  once(event: string | string[], handler: EventHandler): this;\n  once(event: string | string[], handler: EventHandler): this {\n    handler.once = true;\n    return this.on(event, handler);\n  }\n\n  off(event: string, handler?: EventHandler): this {\n    if (handler) {\n      this._listeners[event] = this.listeners(event).filter((listener) => listener !== handler);\n      return this;\n    }\n\n    delete this._listeners[event];\n\n    return this;\n  }\n\n  trigger<T extends any[]>(event: string, ...args: T): this;\n  trigger(event: string[], ...args: any[]): this;\n  trigger(event: string | string[], ...args: any[]): this {\n    if (Array.isArray(event)) {\n      for (const e of event) {\n        this.trigger(e);\n      }\n      return this;\n    }\n\n    for (const listener of this.listeners(event)) {\n      listener(...args);\n    }\n\n    // Remove once\n    this._listeners[event] = this.listeners(event).filter((listener) => listener?.once !== true);\n\n    return this;\n  }\n\n  listeners(event: string): EventHandler[] {\n    return this._listeners[event] === undefined ? [] : this._listeners[event];\n  }\n}\n\n// export class EventBus extends Mixin(EventMixin) {\n// }\n\nexport type EventHandler<T extends any[] = any[]> = ((...event: T) => void) & { once?: boolean };\n\nexport interface EventAwareInterface {\n  on<T extends any[]>(event: string, handler: EventHandler<T>): this;\n  on(event: string | string[], handler: EventHandler): this;\n\n  once<T extends any[]>(event: string, handler: EventHandler<T>): this;\n  once(event: string | string[], handler: EventHandler): this;\n\n  off(event: string, handler?: EventHandler): this;\n\n  trigger<T extends any[]>(event: string, ...args: T): this;\n  trigger(event: string[], ...args: any[]): this;\n\n  listeners(event: string): EventHandler[];\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;AAIA,IAAM,aAAa,MAAM,KAAK,UAAU,EAAE,KAAK;CAC3C,MAAM,QAAQ,OAAO,0BAA0B,IAAI;AACnD,MAAK,IAAI,QAAQ,QACb,QAAO,MAAM;AACjB,QAAO,iBAAiB,MAAM,MAAM;;;;;;AAMxC,IAAM,cAAc,KAAK,eAAe,CAAC,IAAI,KAAK;CAC9C,MAAM,QAAQ,OAAO,eAAe,IAAI;AACxC,KAAI,UAAU,KACV,QAAO;AACX,QAAO,WAAW,OAAO,CAAC,GAAG,cAAc,MAAM,CAAC;;;;;;AAMtD,IAAM,sBAAsB,GAAG,SAAS;AACpC,KAAI,KAAK,WAAW,EAChB,QAAO,KAAA;CACX,IAAI,cAAc,KAAA;CAClB,MAAM,cAAc,KAAK,KAAI,QAAO,WAAW,IAAI,CAAC;AACpD,QAAO,YAAY,OAAM,eAAc,WAAW,SAAS,EAAE,EAAE;EAC3D,MAAM,SAAS,YAAY,KAAI,eAAc,WAAW,KAAK,CAAC;EAC9D,MAAM,uBAAuB,OAAO;AACpC,MAAI,OAAO,OAAM,UAAS,UAAU,qBAAqB,CACrD,eAAc;MAEd;;AAER,QAAO;;;;;;;;;;;AAWX,IAAM,iBAAiB,aAAa,aAAa,UAAU,EAAE,KAAK;CAC9D,IAAI;CACJ,MAAM,QAAQ,KAAK,mBAAmB,GAAG,YAAY,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK,OAAO;CAC/F,MAAM,aAAa,OAAO,OAAO,KAAK;CAItC,MAAM,gBAAgB,WAAW,KAAK;AACtC,MAAK,IAAI,aAAa,aAAa;EAC/B,IAAI,SAAS,WAAW,UAAU;AAElC,OAAK,IAAI,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;GACzC,IAAI,WAAW,OAAO;AACtB,OAAI,cAAc,QAAQ,SAAS,KAAK,IAAI;AACxC,cAAU,YAAY,UAAU,CAAC,eAAe,GAAG,QAAQ,CAAC;AAC5D,kBAAc,KAAK,SAAS;;;;AAIxC,YAAW,cAAc;AACzB,QAAO;;AAEX,IAAM,UAAU,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAI,QAAQ,EAAE,IAAI,EAAE;;;;;AAMjE,IAAM,yBAAyB,MAAM,gBAAgB;CACjD,MAAM,cAAc,YAAY,KAAI,eAAc,WAAW,WAAW,CAAC;CAEzE,IAAI,aAAa;CAGjB,IAAI,wBAAwB;AAC5B,QAAO,uBAAuB;AAE1B,0BAAwB;AAExB,OAAK,IAAI,IAAI,YAAY,SAAS,GAAG,KAAK,GAAG,KAAK;GAC9C,MAAM,eAAe,YAAY,GAAG;AACpC,OAAI,iBAAiB,KAAA,KAAa,iBAAiB,MAAM;AAErD,4BAAwB;AAExB,QAAI,OAAO,yBAAyB,cAAc,KAAK,IAAI,KAAA,EACvD,QAAO,YAAY,GAAG;;;AAIlC;;;;;;;AAQR,IAAM,YAAY,aAAa,YAAY,OAAO,cAAc,IAAI,MAAM,EAAE,EAAE;CAC1E,iBAAiB;AACb,SAAO;;CAEX,iBAAiB;AACb,QAAM,MAAM,sDAAsD;;CAEtE,yBAAyB,GAAG,MAAM;AAC9B,SAAO,OAAO,yBAAyB,sBAAsB,MAAM,YAAY,IAAI,EAAE,EAAE,KAAK;;CAEhG,iBAAiB;AACb,QAAM,IAAI,MAAM,8DAA8D;;CAElF,IAAI,GAAG,MAAM;AACT,SAAO,sBAAsB,MAAM,YAAY,KAAK,KAAA,KAAa,UAAU,UAAU,KAAA;;CAEzF,IAAI,GAAG,MAAM;AACT,UAAQ,sBAAsB,MAAM,YAAY,IAAI,WAAW;;CAEnE,IAAI,GAAG,MAAM,KAAK;EACd,MAAM,qBAAqB,sBAAsB,MAAM,YAAY;AACnE,MAAI,uBAAuB,KAAA,EACvB,OAAM,IAAI,MAAM,2DAA2D;AAC/E,qBAAmB,QAAQ;AAC3B,SAAO;;CAEX,iBAAiB;AACb,QAAM,IAAI,MAAM,0DAA0D;;CAE9E,UAAU;AACN,SAAO,YACF,IAAI,OAAO,oBAAoB,CAC/B,QAAQ,MAAM,SAAS,KAAK,OAAO,KAAK,QAAO,QAAO,KAAK,QAAQ,IAAI,GAAG,EAAE,CAAC,CAAC;;CAE1F,CAAC;;;;;;AAMF,IAAM,iBAAiB,aAAa,gBAAgB,SAAS,CAAC,GAAG,aAAa,EAAE,aAAa,CAAC,CAAC;AAE/F,IAAM,WAAW;CACb,cAAc;CACd,iBAAiB;CACjB,mBAAmB;CACnB,sBAAsB;CACzB;AAGD,IAAM,yBAAS,IAAI,SAAS;AAC5B,IAAM,qBAAqB,UAAU,OAAO,IAAI,MAAM;AACtD,IAAM,kBAAkB,YAAY,iBAAiB,OAAO,IAAI,YAAY,aAAa;AAiCzF,IAAM,4BAA4B,IAAI,OAAO;CACzC,IAAI,IAAI;CACR,MAAM,UAAU,OAAO,CAAC,GAAG,OAAO,oBAAoB,GAAG,EAAE,GAAG,OAAO,oBAAoB,GAAG,CAAC,CAAC;CAC9F,MAAM,eAAe,EAAE;AACvB,MAAK,IAAI,OAAO,QACZ,cAAa,OAAO,OAAO,CAAC,IAAK,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,EAAG,IAAK,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,CAAE,CAAC;AAClO,QAAO;;AAEX,IAAM,oCAAoC,IAAI,OAAO;CACjD,IAAI,IAAI,IAAI,IAAI;AAChB,QAAQ;EACJ,UAAU,0BAA0B,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,GAAG,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,CAAC;EAClO,QAAQ,0BAA0B,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,GAAG,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,CAAA;EAC9N;;AAEL,IAAM,mBAAmB,IAAI,OAAO;CAChC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AACxB,QAAQ;EACJ,OAAO,OAAO,CAAC,IAAI,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,EAAE,IAAI,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,CAAC,CAAC;EAC/M,QAAQ,kCAAkC,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,GAAG,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,CAAC;EACpO,UAAU,kCAAkC,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,GAAG,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,CAAA;EAC5O;;AAEL,IAAM,6BAAa,IAAI,KAAK;AAC5B,IAAM,6BAA6B,GAAG,YAAY;CAC9C,IAAI;CACJ,MAAM,6BAAa,IAAI,KAAK;CAC5B,MAAM,WAAW,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC;AACtC,QAAO,SAAS,OAAO,EACnB,MAAK,IAAI,SAAS,UAAU;EACxB,MAAM,oBAAoB,WAAW,MAAM,UAAU,CAAC,KAAI,UAAS,MAAM,YAAY;EACrF,MAAM,gBAAgB,KAAK,kBAAkB,MAAM,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE;EAExF,MAAM,aADwB,CAAC,GAAG,mBAAmB,GAAG,aAAa,CAC5B,QAAO,MAAK,CAAC,WAAW,IAAI,EAAE,CAAC;AACxE,OAAK,IAAI,YAAY,WACjB,UAAS,IAAI,SAAS;AAC1B,aAAW,IAAI,MAAM;AACrB,WAAS,OAAO,MAAM;;AAG9B,QAAO,CAAC,GAAG,WAAW;;AAE1B,IAAM,uBAAuB,GAAG,YAAY;CACxC,MAAM,0BAA0B,0BAA0B,GAAG,QAAQ,CAChE,KAAI,UAAS,WAAW,IAAI,MAAM,CAAC,CACnC,QAAO,eAAc,CAAC,CAAC,WAAW;AACvC,KAAI,wBAAwB,UAAU,EAClC,QAAO,EAAE;AACb,KAAI,wBAAwB,UAAU,EAClC,QAAO,wBAAwB;AACnC,QAAO,wBAAwB,QAAQ,IAAI,OAAO,gBAAgB,IAAI,GAAG,CAAC;;AAE9E,IAAM,yBAAyB,GAAG,YAAY;CAC1C,MAAM,kBAAkB,QAAQ,KAAI,UAAS,sBAAsB,MAAM,CAAC;AAC1E,KAAI,gBAAgB,WAAW,EAC3B,QAAO,EAAE;AACb,KAAI,gBAAgB,WAAW,EAC3B,QAAO,gBAAgB;AAC3B,QAAO,gBAAgB,QAAQ,IAAI,OAAO,gBAAgB,IAAI,GAAG,CAAC;;AAEtE,IAAM,yBAAyB,UAAU;CACrC,IAAI,qBAAqB,WAAW,IAAI,MAAM;AAC9C,KAAI,CAAC,oBAAoB;AACrB,uBAAqB,EAAE;AACvB,aAAW,IAAI,OAAO,mBAAmB;;AAE7C,QAAO;;AAmCX,SAAS,MAAM,GAAG,cAAc;CAC5B,IAAI,IAAI,IAAI;CACZ,MAAM,aAAa,aAAa,KAAI,gBAAe,YAAY,UAAU;CAIzE,MAAM,mBAAmB,SAAS;AAClC,KAAI,qBAAqB,MAAM;EAC3B,MAAM,gBAAgB,WACjB,KAAI,UAAS,MAAM,kBAAkB,CACrC,QAAO,SAAQ,OAAO,SAAS,WAAW;EAC/C,MAAM,uBAAuB,SAAU,GAAG,MAAM;AAC5C,QAAK,IAAI,gBAAgB,cACrB,cAAa,MAAM,MAAM,KAAK;;EAEtC,MAAM,aAAa,GAAG,mBAAmB,sBAAsB;AAC/D,aAAW,KAAK,WAAW;;CAE/B,SAAS,WAAW,GAAG,MAAM;AACzB,OAAK,MAAM,eAAe,aAEtB,WAAU,MAAM,IAAI,YAAY,GAAG,KAAK,CAAC;AAC7C,MAAI,qBAAqB,QAAQ,OAAO,KAAK,sBAAsB,WAC/D,MAAK,kBAAkB,MAAM,MAAM,KAAK;;AAEhD,YAAW,YAAY,SAAS,sBAAsB,SAChD,cAAc,YAAY,WAAW,GACrC,cAAc,YAAY,WAAW;AAC3C,QAAO,eAAe,YAAY,SAAS,oBAAoB,SACzD,cAAc,cAAc,MAAM,CAAC,YAAY,CAAC,GAChD,SAAS,cAAc,SAAS,UAAU,CAAC;CACjD,IAAI,sBAAsB;AAC1B,KAAI,SAAS,yBAAyB,QAAQ;EAC1C,MAAM,kBAAkB,SAAS,yBAAyB,SACpD,oBAAoB,GAAG,aAAa,GACpC,sBAAsB,GAAG,aAAa;AAC5C,OAAK,IAAI,cAAc,KAAK,oBAAoB,QAAQ,oBAAoB,KAAK,IAAI,KAAK,IAAI,gBAAgB,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,EAAE;GACtJ,MAAM,SAAS,UAAU,oBAAoB;AAC7C,OAAI,OACA,uBAAsB;;AAG9B,gCAA8B,KAAK,oBAAoB,QAAQ,oBAAoB,KAAK,IAAI,KAAK,IAAI,gBAAgB,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,EAAE,oBAAoB;AACtL,gCAA8B,KAAK,oBAAoB,QAAQ,oBAAoB,KAAK,IAAI,KAAK,IAAI,gBAAgB,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE,EAAE,oBAAoB,UAAU;;AAEtM,gBAAe,qBAAqB,aAAa;AACjD,QAAO;;AAEX,IAAM,gCAAgC,yBAAyB,WAAW;CACtE,MAAM,iBAAiB,wBAAwB;CAC/C,MAAM,mBAAmB,wBAAwB;AACjD,KAAI,eACA,MAAK,IAAI,OAAO,eACZ,MAAK,IAAI,aAAa,eAAe,KACjC,WAAU,QAAQ,IAAI;AAClC,KAAI,iBACA,MAAK,IAAI,OAAO,iBACZ,MAAK,IAAI,aAAa,iBAAiB,KACnC,WAAU,QAAQ,KAAK,OAAO,yBAAyB,QAAQ,IAAI,CAAC;;;;AC9VpF,IAAsB,aAAtB,MAAgE;CAC9D,aAA6C,EAAE;CAI/C,GAAG,OAA0B,SAA6B;AACxD,MAAI,MAAM,QAAQ,MAAM,EAAE;AACxB,QAAK,MAAM,KAAK,MACd,MAAK,GAAG,GAAG,QAAQ;AAErB,UAAO;;AAGT,OAAK,WAAW,WAAW,EAAE;AAE7B,OAAK,WAAW,OAAO,KAAK,QAAQ;AAEpC,SAAO;;CAKT,KAAK,OAA0B,SAA6B;AAC1D,UAAQ,OAAO;AACf,SAAO,KAAK,GAAG,OAAO,QAAQ;;CAGhC,IAAI,OAAe,SAA8B;AAC/C,MAAI,SAAS;AACX,QAAK,WAAW,SAAS,KAAK,UAAU,MAAM,CAAC,QAAQ,aAAa,aAAa,QAAQ;AACzF,UAAO;;AAGT,SAAO,KAAK,WAAW;AAEvB,SAAO;;CAKT,QAAQ,OAA0B,GAAG,MAAmB;AACtD,MAAI,MAAM,QAAQ,MAAM,EAAE;AACxB,QAAK,MAAM,KAAK,MACd,MAAK,QAAQ,EAAE;AAEjB,UAAO;;AAGT,OAAK,MAAM,YAAY,KAAK,UAAU,MAAM,CAC1C,UAAS,GAAG,KAAK;AAInB,OAAK,WAAW,SAAS,KAAK,UAAU,MAAM,CAAC,QAAQ,aAAa,UAAU,SAAS,KAAK;AAE5F,SAAO;;CAGT,UAAU,OAA+B;AACvC,SAAO,KAAK,WAAW,WAAW,KAAA,IAAY,EAAE,GAAG,KAAK,WAAW"}