@lionweb/core 0.6.13-beta.7 → 0.7.0-alpha.1

package/dist/utils/array-helpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"array-helpers.d.ts","sourceRoot":"","sources":["../../src/utils/array-helpers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;AAEhD;;;;GAIG;AACH,eAAO,MAAM,OAAO,mCAQnB,CAAA"}

package/dist/utils/array-helpers.js

@@ -1,15 +0,0 @@
-/**
- * Turns a {@link AnyNumberOf feature's value} into an array of objects
- * (possibly empty), regardless of the feature's cardinality and how its
- * value happened to be parsed.
- */
-export const asArray = (thing) => {
-    if (thing === undefined) {
-        return [];
-    }
-    if (Array.isArray(thing)) {
-        return thing;
-    }
-    return [thing];
-};
-//# sourceMappingURL=array-helpers.js.map

package/dist/utils/array-helpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"array-helpers.js","sourceRoot":"","sources":["../../src/utils/array-helpers.ts"],"names":[],"mappings":"AAQA;;;;GAIG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,KAAqB,EAAO,EAAE;IACrD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,EAAE,CAAA;IACb,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,KAAK,CAAA;IAChB,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAA;AAClB,CAAC,CAAA"}

package/dist/utils/cycles.d.ts

@@ -1,8 +0,0 @@
-export type NextsFunction<T> = (t: T) => T[];
-/**
- * Compute whether there's a cycle of dependencies, starting with `thing` and computing "nexts" with the given `nextsFunction`.
- * @return An array with a cycle of "things", starting at the given `thing`.
- *  An array of length 0 means: the given `thing` is not part of any cycle.
- */
-export declare const cycleWith: <T>(thing: T, nextsFunction: NextsFunction<T>) => T[];
-//# sourceMappingURL=cycles.d.ts.map

package/dist/utils/cycles.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cycles.d.ts","sourceRoot":"","sources":["../../src/utils/cycles.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;AAG5C;;;;GAIG;AACH,eAAO,MAAM,SAAS,uDAMrB,CAAA"}

package/dist/utils/cycles.js

@@ -1,26 +0,0 @@
-/**
- * Compute whether there's a cycle of dependencies, starting with `thing` and computing "nexts" with the given `nextsFunction`.
- * @return An array with a cycle of "things", starting at the given `thing`.
- *  An array of length 0 means: the given `thing` is not part of any cycle.
- */
-export const cycleWith = (thing, nextsFunction) => {
-    const result = visit(thing, [], nextsFunction);
-    return result.length > 0 && result[result.length - 1] === thing
-        ? result
-        : [];
-};
-const visit = (current, chain, nextsFunction) => {
-    if (chain.indexOf(current) > -1) {
-        // Add current to end, so we know what sub-array constitutes the actual cycle:
-        return [...chain, current];
-    }
-    const extendedChain = [...chain, current];
-    for (const dependency of nextsFunction(current)) {
-        const recursion = visit(dependency, extendedChain, nextsFunction);
-        if (recursion.length > 0) {
-            return recursion;
-        }
-    }
-    return [];
-};
-//# sourceMappingURL=cycles.js.map

package/dist/utils/cycles.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cycles.js","sourceRoot":"","sources":["../../src/utils/cycles.ts"],"names":[],"mappings":"AAGA;;;;GAIG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAI,KAAQ,EAAE,aAA+B,EAAO,EAAE;IAE3E,MAAM,MAAM,GAAG,KAAK,CAAI,KAAK,EAAE,EAAE,EAAE,aAAa,CAAC,CAAA;IACjD,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,KAAK;QAC3D,CAAC,CAAC,MAAM;QACR,CAAC,CAAC,EAAE,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,KAAK,GAAG,CAAI,OAAU,EAAE,KAAU,EAAE,aAA+B,EAAO,EAAE;IAC9E,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC9B,8EAA8E;QAC9E,OAAO,CAAE,GAAG,KAAK,EAAE,OAAO,CAAE,CAAA;IAChC,CAAC;IACD,MAAM,aAAa,GAAG,CAAE,GAAG,KAAK,EAAE,OAAO,CAAE,CAAA;IAC3C,KAAK,MAAM,UAAU,IAAI,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;QAC9C,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,EAAE,aAAa,EAAE,aAAa,CAAC,CAAA;QACjE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,SAAS,CAAA;QACpB,CAAC;IACL,CAAC;IACD,OAAO,EAAE,CAAA;AACb,CAAC,CAAA"}

package/dist/utils/index.d.ts

@@ -1,7 +0,0 @@
-export * from "./array-helpers.js";
-export * from "./cycles.js";
-export * from "./map-helpers.js";
-export * from "./recursion.js";
-export * from "./sorting.js";
-export * from "./string-mapping.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/utils/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAA;AAClC,cAAc,aAAa,CAAA;AAC3B,cAAc,kBAAkB,CAAA;AAChC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,cAAc,CAAA;AAC5B,cAAc,qBAAqB,CAAA"}

package/dist/utils/index.js

@@ -1,7 +0,0 @@
-export * from "./array-helpers.js";
-export * from "./cycles.js";
-export * from "./map-helpers.js";
-export * from "./recursion.js";
-export * from "./sorting.js";
-export * from "./string-mapping.js";
-//# sourceMappingURL=index.js.map

package/dist/utils/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAA;AAClC,cAAc,aAAa,CAAA;AAC3B,cAAc,kBAAkB,CAAA;AAChC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,cAAc,CAAA;AAC5B,cAAc,qBAAqB,CAAA"}

package/dist/utils/map-helpers.d.ts

@@ -1,26 +0,0 @@
-import { Id } from "../types.js";
-/**
- * Computes a map id -> thing with id.
- */
-export declare const byIdMap: <T extends {
-    id: Id;
-}>(ts: T[]) => {
-    [id: string]: T;
-};
-/**
- * Groups a list of items according to a computed key.
- */
-export declare const groupBy: <T>(ts: T[], keyFunc: (t: T) => string) => Record<string, T[]>;
-/**
- * Filters the values of a map/record according the given predicate.
- */
-export declare const filterValues: <V>(map: Record<string, V>, predicate: (v: V) => boolean) => Record<string, V>;
-/**
- * Computes the given items whose computed keys are duplicates, as a map key &rarr; items.
- */
-export declare const duplicatesAmong: <T>(ts: T[], keyFunc: (t: T) => string) => Record<string, T[]>;
-/**
- * Maps the values of a map/record according to the given mapping function.
- */
-export declare const mapValues: <V, W>(map: Record<string, V>, valFunc: (v: V) => W) => Record<string, W>;
-//# sourceMappingURL=map-helpers.d.ts.map

package/dist/utils/map-helpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"map-helpers.d.ts","sourceRoot":"","sources":["../../src/utils/map-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,EAAE,EAAC,MAAM,aAAa,CAAA;AAG9B;;GAEG;AACH,eAAO,MAAM,OAAO;QAAoB,EAAE;;;CAMzC,CAAA;AAGD;;GAEG;AACH,eAAO,MAAM,OAAO,kCAAmC,MAAM,wBAY5D,CAAA;AAGD;;GAEG;AACH,eAAO,MAAM,YAAY,mDAAoD,OAAO,sBAI/E,CAAA;AAGL;;GAEG;AACH,eAAO,MAAM,eAAe,kCAAmC,MAAM,wBACR,CAAA;AAG7D;;GAEG;AACH,eAAO,MAAM,SAAS,2EAIjB,CAAA"}

package/dist/utils/map-helpers.js

@@ -1,41 +0,0 @@
-/**
- * Computes a map id -> thing with id.
- */
-export const byIdMap = (ts) => {
-    const map = {};
-    ts.forEach((t) => {
-        map[t.id] = t;
-    });
-    return map;
-};
-/**
- * Groups a list of items according to a computed key.
- */
-export const groupBy = (ts, keyFunc) => {
-    const map = {};
-    ts.forEach((t) => {
-        const key = keyFunc(t);
-        let list = map[key];
-        if (list === undefined) {
-            list = [];
-            map[key] = list;
-        }
-        list.push(t);
-    });
-    return map;
-};
-/**
- * Filters the values of a map/record according the given predicate.
- */
-export const filterValues = (map, predicate) => Object.fromEntries(Object.entries(map)
-    .filter(([_, value]) => predicate(value)));
-/**
- * Computes the given items whose computed keys are duplicates, as a map key → items.
- */
-export const duplicatesAmong = (ts, keyFunc) => filterValues(groupBy(ts, keyFunc), (ts) => ts.length > 1);
-/**
- * Maps the values of a map/record according to the given mapping function.
- */
-export const mapValues = (map, valFunc) => Object.fromEntries(Object.entries(map)
-    .map(([key, value]) => [key, valFunc(value)]));
-//# sourceMappingURL=map-helpers.js.map

package/dist/utils/map-helpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"map-helpers.js","sourceRoot":"","sources":["../../src/utils/map-helpers.ts"],"names":[],"mappings":"AAGA;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAuB,EAAO,EAAmB,EAAE;IACtE,MAAM,GAAG,GAAoB,EAAE,CAAA;IAC/B,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACb,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;IACjB,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;AACd,CAAC,CAAA;AAGD;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,EAAO,EAAE,OAAyB,EAAuB,EAAE;IAClF,MAAM,GAAG,GAAwB,EAAE,CAAA;IACnC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACb,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACtB,IAAI,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;QACnB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,IAAI,GAAG,EAAE,CAAA;YACT,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAA;QACnB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;AACd,CAAC,CAAA;AAGD;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAI,GAAsB,EAAE,SAA4B,EAAqB,EAAE,CACvG,MAAM,CAAC,WAAW,CACd,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;KACd,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAChD,CAAA;AAGL;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAI,EAAO,EAAE,OAAyB,EAAuB,EAAE,CAC1F,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAG7D;;GAEG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAO,GAAsB,EAAE,OAAoB,EAAqB,EAAE,CAC/F,MAAM,CAAC,WAAW,CACd,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;KACd,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CACpD,CAAA"}

package/dist/utils/recursion.d.ts

@@ -1,13 +0,0 @@
-/**
- * Type def. of a generic "flatMap" function.
- */
-type FlatMapper<T, R> = (t: T) => R[];
-/**
- * Performs a "flatMap" on a graph that's specified as a start vertex and a function that computes (outgoing) edges.
- * The "flatMap" is performed depth-first, and doesn't loop on cycles.
- */
-declare const flatMapNonCyclingFollowing: <T, R>(mapper: FlatMapper<T, R>, edges: (t: T) => T[]) => FlatMapper<T, R>;
-declare const trivialFlatMapper: <T>(t: T) => T[];
-export type { FlatMapper };
-export { flatMapNonCyclingFollowing, trivialFlatMapper };
-//# sourceMappingURL=recursion.d.ts.map

package/dist/utils/recursion.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"recursion.d.ts","sourceRoot":"","sources":["../../src/utils/recursion.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,KAAK,UAAU,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;AAErC;;;GAGG;AACH,QAAA,MAAM,0BAA0B,4EAiB3B,CAAA;AAGL,QAAA,MAAM,iBAAiB,kBAAmB,CAAA;AAG1C,YAAY,EACR,UAAU,EACb,CAAA;AAED,OAAO,EACH,0BAA0B,EAC1B,iBAAiB,EACpB,CAAA"}

package/dist/utils/recursion.js

@@ -1,21 +0,0 @@
-/**
- * Performs a "flatMap" on a graph that's specified as a start vertex and a function that computes (outgoing) edges.
- * The "flatMap" is performed depth-first, and doesn't loop on cycles.
- */
-const flatMapNonCyclingFollowing = (mapper, edges) => (startVertex) => {
-    const visited = [];
-    const rs = [];
-    const recurse = (t) => {
-        if (visited.indexOf(t) > -1) {
-            return;
-        }
-        visited.push(t);
-        rs.push(...mapper(t));
-        edges(t).forEach(recurse);
-    };
-    recurse(startVertex);
-    return rs;
-};
-const trivialFlatMapper = (t) => [t];
-export { flatMapNonCyclingFollowing, trivialFlatMapper };
-//# sourceMappingURL=recursion.js.map

package/dist/utils/recursion.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"recursion.js","sourceRoot":"","sources":["../../src/utils/recursion.ts"],"names":[],"mappings":"AAKA;;;GAGG;AACH,MAAM,0BAA0B,GAAG,CAC/B,MAAwB,EACxB,KAAoB,EACJ,EAAE,CAClB,CAAC,WAAc,EAAO,EAAE;IACpB,MAAM,OAAO,GAAQ,EAAE,CAAA;IACvB,MAAM,EAAE,GAAQ,EAAE,CAAA;IAClB,MAAM,OAAO,GAAG,CAAC,CAAI,EAAE,EAAE;QACrB,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC1B,OAAM;QACV,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACf,EAAE,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QACrB,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IAC7B,CAAC,CAAA;IACD,OAAO,CAAC,WAAW,CAAC,CAAA;IACpB,OAAO,EAAE,CAAA;AACb,CAAC,CAAA;AAGL,MAAM,iBAAiB,GAAG,CAAI,CAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;AAO1C,OAAO,EACH,0BAA0B,EAC1B,iBAAiB,EACpB,CAAA"}

package/dist/utils/sorting.d.ts

@@ -1,7 +0,0 @@
-/**
- * Various functional utilities for sorting things.
- */
-export type Comparer<T> = (l: T, r: T) => number;
-export declare const stringyCompare: <T>(keyFunc: (t: T) => string) => Comparer<T>;
-export declare const sortByStringKey: <T>(ts: T[], keyFunc: (t: T) => string) => T[];
-//# sourceMappingURL=sorting.d.ts.map

package/dist/utils/sorting.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorting.d.ts","sourceRoot":"","sources":["../../src/utils/sorting.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAA;AAKhD,eAAO,MAAM,cAAc,yBAA0B,MAAM,gBACF,CAAA;AAEzD,eAAO,MAAM,eAAe,kCAAmC,MAAM,QAC5B,CAAA"}

package/dist/utils/sorting.js

@@ -1,7 +0,0 @@
-/**
- * Various functional utilities for sorting things.
- */
-const stringCompare = (l, r) => l === r ? 0 : (l > r ? 1 : -1);
-export const stringyCompare = (keyFunc) => (l, r) => stringCompare(keyFunc(l), keyFunc(r));
-export const sortByStringKey = (ts, keyFunc) => [...ts].sort(stringyCompare(keyFunc));
-//# sourceMappingURL=sorting.js.map

package/dist/utils/sorting.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorting.js","sourceRoot":"","sources":["../../src/utils/sorting.ts"],"names":[],"mappings":"AAAA;;GAEG;AAKH,MAAM,aAAa,GAAqB,CAAC,CAAC,EAAE,CAAC,EAAU,EAAE,CACrD,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAElC,MAAM,CAAC,MAAM,cAAc,GAAG,CAAI,OAAyB,EAAe,EAAE,CACxE,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;AAEzD,MAAM,CAAC,MAAM,eAAe,GAAG,CAAI,EAAO,EAAE,OAAyB,EAAE,EAAE,CACrE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAA"}

package/dist/utils/string-mapping.d.ts

@@ -1,6 +0,0 @@
-export type StringsMapper = (...strings: string[]) => string;
-export type StringMapper = (str: string) => string;
-export declare const concatenator: (separator: string) => StringsMapper;
-export declare const lastOf: StringsMapper;
-export declare const chain: (stringsMapper: StringsMapper, ...stringMappers: StringMapper[]) => StringsMapper;
-//# sourceMappingURL=string-mapping.d.ts.map

package/dist/utils/string-mapping.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"string-mapping.d.ts","sourceRoot":"","sources":["../../src/utils/string-mapping.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,KAAK,MAAM,CAAA;AAE5D,MAAM,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,CAAA;AAGlD,eAAO,MAAM,YAAY,cAAe,MAAM,KAAG,aACN,CAAA;AAE3C,eAAO,MAAM,MAAM,EAAE,aAC0B,CAAA;AAE/C,eAAO,MAAM,KAAK,kBAAmB,aAAa,oBAAoB,YAAY,EAAE,KAAG,aAOlF,CAAA"}

package/dist/utils/string-mapping.js

@@ -1,10 +0,0 @@
-export const concatenator = (separator) => (...strings) => strings.join(separator);
-export const lastOf = (...strings) => strings[strings.length - 1];
-export const chain = (stringsMapper, ...stringMappers) => (...strings) => {
-    let result = stringsMapper(...strings);
-    stringMappers.forEach((mapper) => {
-        result = mapper(result);
-    });
-    return result;
-};
-//# sourceMappingURL=string-mapping.js.map

package/dist/utils/string-mapping.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"string-mapping.js","sourceRoot":"","sources":["../../src/utils/string-mapping.ts"],"names":[],"mappings":"AAKA,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,SAAiB,EAAiB,EAAE,CAC7D,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;AAE3C,MAAM,CAAC,MAAM,MAAM,GACf,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAE/C,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,aAA4B,EAAE,GAAG,aAA6B,EAAiB,EAAE,CACnG,CAAC,GAAG,OAAiB,EAAE,EAAE;IACrB,IAAI,MAAM,GAAG,aAAa,CAAC,GAAG,OAAO,CAAC,CAAA;IACtC,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;QAC7B,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAC3B,CAAC,CAAC,CAAA;IACF,OAAO,MAAM,CAAA;AACjB,CAAC,CAAA"}