@goodbones/core 0.1.0-beta.3 → 0.1.0-beta.4

package/build/esm/manifest/infer.js

@@ -0,0 +1,455 @@
+// ---------------------------------------------------------------------------
+// Paths
+const dirnameOf = (file) => {
+    const at = file.lastIndexOf("/");
+    return at === -1 ? "" : file.slice(0, at);
+};
+const basenameOf = (file) => file.slice(file.lastIndexOf("/") + 1);
+// `folder` is `p` or an ancestor of it. The empty folder is every path's.
+const isUnder = (p, folder) => folder === "" || p === folder || p.startsWith(`${folder}/`);
+const depthBelow = (p, folder) => p === folder ? 0 : (folder === "" ? p : p.slice(folder.length + 1)).split("/").length;
+const sorted = (items) => [...items].sort();
+const memberOf = (p, generalize) => {
+    for (const group of generalize) {
+        for (const member of group.members) {
+            const folder = group.parent === "" ? member : `${group.parent}/${member}`;
+            if (isUnder(p, folder))
+                return { group, member };
+        }
+    }
+    return null;
+};
+const capturedPathOf = (group) => group.parent === "" ? `{${group.capture}}` : `${group.parent}/{${group.capture}}`;
+const rewrite = (p, generalize) => {
+    const membership = memberOf(p, generalize);
+    if (membership === null)
+        return p;
+    const { group, member } = membership;
+    const folder = group.parent === "" ? member : `${group.parent}/${member}`;
+    const captured = capturedPathOf(group);
+    return p === folder ? captured : `${captured}${p.slice(folder.length)}`;
+};
+const folderAt = (root, p) => {
+    if (p === root.path)
+        return root;
+    const rest = root.path === "" ? p : p.slice(root.path.length + 1);
+    let at = root;
+    for (const segment of rest.split("/")) {
+        const existing = at.children.get(segment);
+        if (existing !== undefined) {
+            at = existing;
+            continue;
+        }
+        const made = {
+            path: at.path === "" ? segment : `${at.path}/${segment}`,
+            name: segment,
+            files: [],
+            children: new Map(),
+        };
+        at.children.set(segment, made);
+        at = made;
+    }
+    return at;
+};
+const trieOf = (input, generalize) => {
+    const roots = input.roots.map((root) => ({
+        path: root,
+        name: basenameOf(root),
+        files: [],
+        children: new Map(),
+    }));
+    for (const file of input.files) {
+        const folder = rewrite(dirnameOf(file), generalize);
+        const root = roots.find((one) => isUnder(folder, one.path));
+        if (root === undefined)
+            continue;
+        folderAt(root, folder).files.push(file);
+    }
+    return roots;
+};
+const basesOf = (input, generalize) => {
+    const all = new Set(input.roots);
+    for (const one of input.packages) {
+        all.add(rewrite(one.root, generalize));
+        if (one.source !== null)
+            all.add(rewrite(one.source, generalize));
+    }
+    return { all: sorted(all) };
+};
+const baseOf = (folder, bases) => {
+    let best = null;
+    for (const base of bases.all) {
+        if (!isUnder(folder, base))
+            continue;
+        if (best === null || base.length > best.length)
+            best = base;
+    }
+    return best ?? "";
+};
+// A folder is a node when it is within `depth` of the base it counts from, or
+// when it lies on the way to one — the folders between a walk root and a
+// package are structure, and a node each whatever the depth.
+const isNode = (folder, input, bases) => input.roots.includes(folder.path) ||
+    bases.all.some((base) => isUnder(base, folder.path)) ||
+    depthBelow(folder.path, baseOf(folder.path, bases)) <= input.depth;
+const nodeOf = (folder, input, bases) => {
+    const node = {
+        path: folder.path,
+        key: `${folder.name}/`,
+        folder,
+        files: [...folder.files],
+        children: new Map(),
+        stray: false,
+        allow: new Set(),
+        external: new Set(),
+        edges: 0,
+    };
+    const absorb = (from) => {
+        for (const child of from.children.values()) {
+            if (isNode(child, input, bases)) {
+                node.children.set(child.name, nodeOf(child, input, bases));
+            }
+            else {
+                node.stray = true;
+                for (const file of child.files)
+                    node.files.push(file);
+                absorb(child);
+            }
+        }
+    };
+    absorb(folder);
+    return node;
+};
+// The deepest node whose folder holds `p` (a rewritten path), or null when
+// no walk root does.
+const governorOf = (p, roots) => {
+    const root = roots.find((one) => isUnder(p, one.path));
+    if (root === undefined)
+        return null;
+    const descend = (at) => {
+        for (const child of at.children.values())
+            if (isUnder(p, child.path))
+                return descend(child);
+        return at;
+    };
+    return descend(root);
+};
+const eachNode = (roots, visit) => {
+    const walk = (node) => {
+        visit(node);
+        for (const child of node.children.values())
+            walk(child);
+    };
+    for (const root of roots)
+        walk(root);
+};
+// ---------------------------------------------------------------------------
+// Allow sets.
+// What a local target is written as: the node that governs it, as a glob. A
+// file directly in a node that has children of its own is `node/*` — the
+// layer's own files, such as a barrel, and not the tiers beneath — and
+// anything else is `node/**`. A capture in that path survives only when the
+// importer is in the same member; from anywhere else it is `*`.
+const entryFor = (importer, target, roots, generalize) => {
+    const rewritten = rewrite(target, generalize);
+    const node = governorOf(rewritten, roots);
+    if (node === null)
+        return target;
+    const from = memberOf(importer, generalize);
+    const to = memberOf(target, generalize);
+    const sameGroup = from !== null &&
+        to !== null &&
+        from.group.parent === to.group.parent &&
+        from.group.capture === to.group.capture;
+    if (to !== null && sameGroup && to.member !== from.member) {
+        const reach = to.group.crossReach;
+        const folder = to.group.parent === "" ? to.member : `${to.group.parent}/${to.member}`;
+        if (reach !== null && target === `${folder}/${reach}`) {
+            return `${to.group.parent === "" ? "" : `${to.group.parent}/`}*/${reach}`;
+        }
+    }
+    const direct = dirnameOf(rewritten) === node.path && node.children.size > 0;
+    const glob = `${node.path}/${direct ? "*" : "**"}`;
+    if (to === null)
+        return glob;
+    const sameMember = sameGroup && from.member === to.member;
+    return sameMember ? glob : glob.replace(`{${to.group.capture}}`, "*");
+};
+const fillAllowSets = (roots, input, generalize) => {
+    eachNode(roots, (node) => {
+        for (const file of node.files) {
+            for (const target of input.targetsOf(file)) {
+                node.edges += 1;
+                switch (target.kind) {
+                    case "local":
+                        node.allow.add(entryFor(file, target.path, roots, generalize));
+                        break;
+                    case "builtin":
+                        node.allow.add(target.path);
+                        break;
+                    case "external":
+                        node.external.add(target.package);
+                        break;
+                }
+            }
+        }
+    });
+};
+// ---------------------------------------------------------------------------
+// Candidates: siblings that share a shape.
+// `auth.module.ts` and `user.module.ts` are one kind of file; `index.ts` is
+// its own. The first segment is the name, the rest is what it is.
+const stereotypeOf = (file) => {
+    const parts = basenameOf(file).split(".");
+    return parts.length >= 3 ? `*.${parts.slice(1).join(".")}` : basenameOf(file);
+};
+const intersect = (a, b) => sorted([...a].filter((one) => b.has(one)));
+const alike = (a, b) => {
+    if (intersect(a.folders, b.folders).length >= 2)
+        return true;
+    const union = new Set([...a.stereotypes, ...b.stereotypes]);
+    return union.size > 0 && intersect(a.stereotypes, b.stereotypes).length / union.size >= 0.5;
+};
+const shapeOf = (folder) => ({
+    folders: new Set(folder.children.keys()),
+    stereotypes: new Set(folder.files.map(stereotypeOf)),
+});
+// `modules` → `module`; `entities` → `entity`; `packages` → `package`. What a
+// human would name the capture; anything unpronounceable is `name`.
+export const singularOf = (plural) => {
+    const word = plural.replace(/[^A-Za-z0-9]/g, "");
+    const singular = /ies$/.test(word)
+        ? word.replace(/ies$/, "y")
+        : /(ses|xes|zes|shes|ches)$/.test(word)
+            ? word.slice(0, -2)
+            : /[^s]s$/.test(word)
+                ? word.slice(0, -1)
+                : word;
+    return singular === "" || /^[0-9]/.test(singular) ? "name" : singular;
+};
+const groupsOf = (members) => {
+    const parent = new Map(members.map(([name]) => [name, name]));
+    const find = (name) => {
+        let at = name;
+        while ((parent.get(at) ?? at) !== at)
+            at = parent.get(at) ?? at;
+        return at;
+    };
+    for (const [i, [a, shapeA]] of members.entries()) {
+        for (const [b, shapeB] of members.slice(i + 1)) {
+            if (alike(shapeA, shapeB))
+                parent.set(find(a), find(b));
+        }
+    }
+    const groups = new Map();
+    for (const [name] of members) {
+        const key = find(name);
+        groups.set(key, [...(groups.get(key) ?? []), name]);
+    }
+    return [...groups.values()]
+        .filter((group) => group.length >= 2)
+        .map((group) => sorted(group))
+        .sort((a, b) => (a[0] ?? "").localeCompare(b[0] ?? ""));
+};
+// The sibling groups under every node of the tree as it stands with the
+// generalizations already accepted — never inside one, since a generalized
+// node's children are already a merge.
+export const candidatesOf = (input, generalize = []) => {
+    const trie = trieOf(input, generalize);
+    const bases = basesOf(input, generalize);
+    const roots = trie.map((folder) => nodeOf(folder, input, bases));
+    const candidates = [];
+    eachNode(roots, (node) => {
+        if (node.path.includes("{") || node.children.size < 2)
+            return;
+        const members = sorted(node.children.keys()).flatMap((name) => {
+            const folder = node.folder.children.get(name);
+            return folder === undefined ? [] : [[name, shapeOf(folder)]];
+        });
+        const shapes = new Map(members);
+        const taken = new Set();
+        for (const group of groupsOf(members)) {
+            const shapesOfGroup = group.flatMap((name) => {
+                const shape = shapes.get(name);
+                return shape === undefined ? [] : [shape];
+            });
+            const sharedOf = (pick) => {
+                const [head, ...rest] = shapesOfGroup;
+                if (head === undefined)
+                    return [];
+                return sorted(rest.reduce((acc, shape) => new Set(intersect(acc, pick(shape))), pick(head)));
+            };
+            const sharedFolders = sharedOf((shape) => shape.folders);
+            const sharedStereotypes = sharedOf((shape) => shape.stereotypes);
+            let capture = singularOf(node.folder.name);
+            for (let n = 2; taken.has(capture); n += 1)
+                capture = `${singularOf(node.folder.name)}${String(n)}`;
+            taken.add(capture);
+            // Edges between members, and whether they all land on one place.
+            const memberFolder = (name) => node.path === "" ? name : `${node.path}/${name}`;
+            const isIn = (p) => group.find((name) => isUnder(p, memberFolder(name))) ?? null;
+            let crossEdges = 0;
+            const landings = new Set();
+            for (const file of input.files) {
+                const from = isIn(file);
+                if (from === null)
+                    continue;
+                for (const target of input.targetsOf(file)) {
+                    if (target.kind !== "local")
+                        continue;
+                    const to = isIn(target.path);
+                    if (to === null || to === from)
+                        continue;
+                    crossEdges += 1;
+                    landings.add(target.path.slice(memberFolder(to).length + 1));
+                }
+            }
+            const [landing] = sorted(landings);
+            candidates.push({
+                parent: node.path,
+                members: group,
+                sharedFolders,
+                sharedStereotypes,
+                capture,
+                crossEdges,
+                crossReach: landings.size === 1 && landing !== undefined ? landing : null,
+            });
+        }
+    });
+    return candidates.sort((a, b) => {
+        const byParent = a.parent.localeCompare(b.parent);
+        return byParent !== 0 ? byParent : (a.members[0] ?? "").localeCompare(b.members[0] ?? "");
+    });
+};
+// ---------------------------------------------------------------------------
+// Collapse: children that all reach the same things are one node.
+const normalized = (node, under) => sorted(new Set([...node.allow].map((entry) => (isUnder(entry, under) ? `${under}/**` : entry))));
+const sameList = (a, b) => a.length === b.length && a.every((one, index) => one === b[index]);
+const collapse = (node) => {
+    for (const child of node.children.values())
+        collapse(child);
+    if (node.children.size === 0)
+        return;
+    const children = [...node.children.values()];
+    if (children.some((child) => child.children.size > 0))
+        return;
+    const [first] = children;
+    if (first === undefined)
+        return;
+    const shared = normalized(first, node.path);
+    const externals = sorted(first.external);
+    const agree = children.every((child) => sameList(normalized(child, node.path), shared) && sameList(sorted(child.external), externals));
+    if (!agree)
+        return;
+    const own = normalized(node, node.path);
+    if (!own.every((entry) => shared.includes(entry)))
+        return;
+    if (!sorted(node.external).every((entry) => externals.includes(entry)))
+        return;
+    node.allow = new Set(shared);
+    node.external = new Set(externals);
+    for (const child of children) {
+        for (const file of child.files)
+            node.files.push(file);
+        node.edges += child.edges;
+    }
+    node.children = new Map();
+    node.stray = true;
+};
+// ---------------------------------------------------------------------------
+// Emitting.
+const shortenWith = (aliases) => {
+    const entries = Object.entries(aliases).sort(([, a], [, b]) => b.length - a.length);
+    return (p) => {
+        for (const [alias, target] of entries) {
+            if (p === target)
+                return alias;
+            if (p.startsWith(`${target}/`))
+                return `${alias}${p.slice(target.length)}`;
+        }
+        return p;
+    };
+};
+const CATCH_ALL = "**/";
+export const inferManifest = (input, options) => {
+    const { generalize } = options;
+    const trie = trieOf(input, generalize);
+    const bases = basesOf(input, generalize);
+    const roots = trie.map((folder) => nodeOf(folder, input, bases));
+    fillAllowSets(roots, input, generalize);
+    if (options.collapse)
+        for (const root of roots)
+            collapse(root);
+    const shorten = shortenWith(options.aliases ?? {});
+    let unrestricted = 0;
+    let nodes = 0;
+    let files = 0;
+    const describe = (node) => {
+        const membership = generalize.find((group) => capturedPathOf(group) === node.path);
+        const across = membership === undefined
+            ? ""
+            : ` across ${String(membership.members.length)} ${basenameOf(membership.parent)} (${membership.members.join(", ")})`;
+        const count = (n, noun) => `${String(n)} ${noun}${n === 1 ? "" : "s"}`;
+        return node.files.length === 0
+            ? `As built on ${options.date}: no files of its own.`
+            : `As built on ${options.date}${across}: ${count(node.files.length, "file")}, ${count(node.edges, "edge")}.`;
+    };
+    const emit = (node) => {
+        nodes += 1;
+        files += node.files.length;
+        const children = {};
+        for (const name of sorted(node.children.keys())) {
+            const child = node.children.get(name);
+            if (child !== undefined)
+                children[child.key] = emit(child);
+        }
+        if (node.stray)
+            children[CATCH_ALL] = { layout: "open", children: {} };
+        const imports = node.files.length === 0
+            ? {}
+            : {
+                imports: {
+                    message: `This import is not on the allowlist infer wrote for ${node.path}/ on ${options.date}. Add it by name if it belongs here.`,
+                    unrestricted: true,
+                    ...(node.allow.size > 0 ? { allow: sorted([...node.allow].map(shorten)) } : {}),
+                    ...(node.external.size > 0 ? { external: sorted(node.external) } : {}),
+                },
+            };
+        if (node.files.length > 0)
+            unrestricted += 1;
+        return {
+            message: describe(node),
+            layout: "open",
+            ...imports,
+            children,
+        };
+    };
+    const tree = {};
+    for (const root of roots)
+        tree[`${shorten(root.path)}/`] = emit(root);
+    const within = input.roots.map((root) => shorten(`${root}/**`));
+    const manifest = {
+        resolve: options.resolve,
+        baseline: options.baseline,
+        ...(options.aliases === undefined || Object.keys(options.aliases).length === 0
+            ? {}
+            : { aliases: options.aliases }),
+        limits: { unrestricted, partial: 0 },
+        ...(options.hasCycles
+            ? {}
+            : {
+                graph: {
+                    cycles: [
+                        {
+                            name: "no-cycles",
+                            message: "These files import each other, directly or through others. The tree had no cycle when this manifest was inferred; keep it that way.",
+                            within: within.length === 1 ? (within[0] ?? "") : within,
+                        },
+                    ],
+                },
+            }),
+        tree,
+    };
+    return { manifest, nodes, files };
+};
+//# sourceMappingURL=infer.js.map

package/build/esm/manifest/infer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"infer.js","sourceRoot":"","sources":["../../../src/manifest/infer.ts"],"names":[],"mappings":"AA+FA,8EAA8E;AAC9E,QAAQ;AAER,MAAM,SAAS,GAAG,CAAC,IAAY,EAAU,EAAE;IACzC,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACjC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC5C,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAEnF,0EAA0E;AAC1E,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,MAAc,EAAW,EAAE,CACrD,MAAM,KAAK,EAAE,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;AAE9D,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,MAAc,EAAU,EAAE,CACvD,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;AAExF,MAAM,MAAM,GAAG,CAAI,KAAkB,EAAoB,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;AAQ9E,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,UAAyC,EAAqB,EAAE;IAC3F,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;YAC1E,IAAI,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACnD,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,KAAqB,EAAU,EAAE,CACvD,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,OAAO,GAAG,CAAC;AAEpF,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,UAAyC,EAAU,EAAE;IAC/E,MAAM,UAAU,GAAG,QAAQ,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC3C,IAAI,UAAU,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,UAAU,CAAC;IACrC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;IAC1E,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;AAC1E,CAAC,CAAC;AAaF,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,CAAS,EAAU,EAAE;IACnD,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClE,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,EAAE,GAAG,QAAQ,CAAC;YACd,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAW;YACnB,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,OAAO,EAAE;YACxD,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,IAAI,GAAG,EAAE;SACpB,CAAC;QACF,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC/B,EAAE,GAAG,IAAI,CAAC;IACZ,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AAIF,MAAM,MAAM,GAAG,CAAC,KAAiB,EAAE,UAAyC,EAAQ,EAAE;IACpF,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAU,EAAE,CAAC,CAAC;QAC/C,IAAI,EAAE,IAAI;QACV,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC;QACtB,KAAK,EAAE,EAAE;QACT,QAAQ,EAAE,IAAI,GAAG,EAAE;KACpB,CAAC,CAAC,CAAC;IACJ,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC;QACpD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5D,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAWF,MAAM,OAAO,GAAG,CAAC,KAAiB,EAAE,UAAyC,EAAS,EAAE;IACtF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,KAAK,CAAC,CAAC;IACzC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACjC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;QACvC,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI;YAAE,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;AAC9B,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,MAAc,EAAE,KAAY,EAAU,EAAE;IACtD,IAAI,IAAI,GAAkB,IAAI,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC;YAAE,SAAS;QACrC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM;YAAE,IAAI,GAAG,IAAI,CAAC;IAC9D,CAAC;IACD,OAAO,IAAI,IAAI,EAAE,CAAC;AACpB,CAAC,CAAC;AAEF,8EAA8E;AAC9E,yEAAyE;AACzE,6DAA6D;AAC7D,MAAM,MAAM,GAAG,CAAC,MAAc,EAAE,KAAiB,EAAE,KAAY,EAAW,EAAE,CAC1E,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC;IACjC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACpD,UAAU,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC;AAqBrE,MAAM,MAAM,GAAG,CAAC,MAAc,EAAE,KAAiB,EAAE,KAAY,EAAQ,EAAE;IACvE,MAAM,IAAI,GAAS;QACjB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,GAAG,EAAE,GAAG,MAAM,CAAC,IAAI,GAAG;QACtB,MAAM;QACN,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC;QACxB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,KAAK,EAAE,KAAK;QACZ,KAAK,EAAE,IAAI,GAAG,EAAE;QAChB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,KAAK,EAAE,CAAC;KACT,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,IAAY,EAAQ,EAAE;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,IAAI,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;YAC7D,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;gBAClB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;oBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtD,MAAM,CAAC,KAAK,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IACF,MAAM,CAAC,MAAM,CAAC,CAAC;IACf,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF,2EAA2E;AAC3E,qBAAqB;AACrB,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,KAA0B,EAAe,EAAE;IACxE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,OAAO,GAAG,CAAC,EAAQ,EAAQ,EAAE;QACjC,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE;YAAE,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC;gBAAE,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;QAC5F,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IACF,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;AACvB,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,CAAC,KAA0B,EAAE,KAA2B,EAAQ,EAAE;IACjF,MAAM,IAAI,GAAG,CAAC,IAAU,EAAQ,EAAE;QAChC,KAAK,CAAC,IAAI,CAAC,CAAC;QACZ,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;YAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC;AACvC,CAAC,CAAC;AAEF,8EAA8E;AAC9E,cAAc;AAEd,4EAA4E;AAC5E,yEAAyE;AACzE,uEAAuE;AACvE,4EAA4E;AAC5E,gEAAgE;AAChE,MAAM,QAAQ,GAAG,CACf,QAAgB,EAChB,MAAc,EACd,KAA0B,EAC1B,UAAyC,EACjC,EAAE;IACV,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC1C,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAEjC,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC5C,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACxC,MAAM,SAAS,GACb,IAAI,KAAK,IAAI;QACb,EAAE,KAAK,IAAI;QACX,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM;QACrC,IAAI,CAAC,KAAK,CAAC,OAAO,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC;IAC1C,IAAI,EAAE,KAAK,IAAI,IAAI,SAAS,IAAI,EAAE,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;QAC1D,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC;QAClC,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;QACtF,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,KAAK,GAAG,MAAM,IAAI,KAAK,EAAE,EAAE,CAAC;YACtD,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,KAAK,EAAE,CAAC;QAC5E,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,KAAK,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC;IAC5E,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACnD,IAAI,EAAE,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC7B,MAAM,UAAU,GAAG,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,CAAC;IAC1D,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,GAAG,CAAC,CAAC;AACxE,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CACpB,KAA0B,EAC1B,KAAiB,EACjB,UAAyC,EACnC,EAAE;IACR,QAAQ,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;QACvB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;gBAChB,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;oBACpB,KAAK,OAAO;wBACV,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;wBAC/D,MAAM;oBACR,KAAK,SAAS;wBACZ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;wBAC5B,MAAM;oBACR,KAAK,UAAU;wBACb,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;wBAClC,MAAM;gBACV,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,8EAA8E;AAC9E,2CAA2C;AAE3C,4EAA4E;AAC5E,kEAAkE;AAClE,MAAM,YAAY,GAAG,CAAC,IAAY,EAAU,EAAE;IAC5C,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC1C,OAAO,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;AAChF,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,CAAsB,EAAE,CAAsB,EAAyB,EAAE,CAC1F,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAE7C,MAAM,KAAK,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAW,EAAE;IAC5C,IAAI,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IAC5D,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC;AAC9F,CAAC,CAAC;AAIF,MAAM,OAAO,GAAG,CAAC,MAAc,EAAS,EAAE,CAAC,CAAC;IAC1C,OAAO,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IACxC,WAAW,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;CACrD,CAAC,CAAC;AAEH,8EAA8E;AAC9E,oEAAoE;AACpE,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAc,EAAU,EAAE;IACnD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAChC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;QAC3B,CAAC,CAAC,0BAA0B,CAAC,IAAI,CAAC,IAAI,CAAC;YACrC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;gBACnB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACnB,CAAC,CAAC,IAAI,CAAC;IACb,OAAO,QAAQ,KAAK,EAAE,IAAI,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;AACxE,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,CACf,OAAuC,EACD,EAAE;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAiB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9E,MAAM,IAAI,GAAG,CAAC,IAAY,EAAU,EAAE;QACpC,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE;YAAE,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAChE,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC/C,IAAI,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;SACxB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;SACpC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC5D,CAAC,CAAC;AAEF,wEAAwE;AACxE,2EAA2E;AAC3E,uCAAuC;AACvC,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAiB,EACjB,UAAU,GAAkC,EAAE,EACpB,EAAE;IAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IACjE,MAAM,UAAU,GAAqB,EAAE,CAAC;IAExC,QAAQ,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;QACvB,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;YAAE,OAAO;QAC9D,MAAM,OAAO,GAAmC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC5F,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9C,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAoB,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YACtC,MAAM,aAAa,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC/B,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC5C,CAAC,CAAC,CAAC;YACH,MAAM,QAAQ,GAAG,CAAC,IAA2C,EAAyB,EAAE;gBACtF,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,aAAa,CAAC;gBACtC,IAAI,IAAI,KAAK,SAAS;oBAAE,OAAO,EAAE,CAAC;gBAClC,OAAO,MAAM,CACX,IAAI,CAAC,MAAM,CACT,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EACpD,IAAI,CAAC,IAAI,CAAC,CACX,CACF,CAAC;YACJ,CAAC,CAAC;YACF,MAAM,aAAa,GAAG,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACzD,MAAM,iBAAiB,GAAG,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YACjE,IAAI,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC;gBACxC,OAAO,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1D,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAEnB,iEAAiE;YACjE,MAAM,YAAY,GAAG,CAAC,IAAY,EAAU,EAAE,CAC5C,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAiB,EAAE,CACxC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YAC/D,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;YACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxB,IAAI,IAAI,KAAK,IAAI;oBAAE,SAAS;gBAC5B,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC3C,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO;wBAAE,SAAS;oBACtC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC7B,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI;wBAAE,SAAS;oBACzC,UAAU,IAAI,CAAC,CAAC;oBAChB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/D,CAAC;YACH,CAAC;YACD,MAAM,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YACnC,UAAU,CAAC,IAAI,CAAC;gBACd,MAAM,EAAE,IAAI,CAAC,IAAI;gBACjB,OAAO,EAAE,KAAK;gBACd,aAAa;gBACb,iBAAiB;gBACjB,OAAO;gBACP,UAAU;gBACV,UAAU,EAAE,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;aAC1E,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAClD,OAAO,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5F,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,8EAA8E;AAC9E,kEAAkE;AAElE,MAAM,UAAU,GAAG,CAAC,IAAU,EAAE,KAAa,EAAyB,EAAE,CACtE,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAEnG,MAAM,QAAQ,GAAG,CAAC,CAAwB,EAAE,CAAwB,EAAW,EAAE,CAC/E,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAErE,MAAM,QAAQ,GAAG,CAAC,IAAU,EAAQ,EAAE;IACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC5D,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO;IACrC,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7C,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC;QAAE,OAAO;IAE9D,MAAM,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC;IACzB,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO;IAChC,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAC1B,CAAC,KAAK,EAAE,EAAE,CACR,QAAQ,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,SAAS,CAAC,CAChG,CAAC;IACF,IAAI,CAAC,KAAK;QAAE,OAAO;IACnB,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO;IAC1D,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO;IAE/E,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;YAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC;IAC5B,CAAC;IACD,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;IAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;AACpB,CAAC,CAAC;AAEF,8EAA8E;AAC9E,YAAY;AAEZ,MAAM,WAAW,GAAG,CAAC,OAAyC,EAAE,EAAE;IAChE,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACpF,OAAO,CAAC,CAAS,EAAU,EAAE;QAC3B,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,MAAM;gBAAE,OAAO,KAAK,CAAC;YAC/B,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,MAAM,GAAG,CAAC;gBAAE,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QAC7E,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,KAAK,CAAC;AAExB,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAiB,EAAE,OAAqB,EAAY,EAAE;IAClF,MAAM,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;IAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IACjE,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IACxC,IAAI,OAAO,CAAC,QAAQ;QAAE,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IAE/D,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IACnD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,MAAM,QAAQ,GAAG,CAAC,IAAU,EAAU,EAAE;QACtC,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;QACnF,MAAM,MAAM,GACV,UAAU,KAAK,SAAS;YACtB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,WAAW,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACzH,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,IAAY,EAAU,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAC/F,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAC5B,CAAC,CAAC,eAAe,OAAO,CAAC,IAAI,wBAAwB;YACrD,CAAC,CAAC,eAAe,OAAO,CAAC,IAAI,GAAG,MAAM,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC;IACjH,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,IAAU,EAAgB,EAAE;QACxC,KAAK,IAAI,CAAC,CAAC;QACX,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC3B,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAClD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YAChD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,KAAK,KAAK,SAAS;gBAAE,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,IAAI,CAAC,KAAK;YAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QAEvE,MAAM,OAAO,GACX,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YACrB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,OAAO,EAAE;oBACP,OAAO,EAAE,uDAAuD,IAAI,CAAC,IAAI,QAAQ,OAAO,CAAC,IAAI,sCAAsC;oBACnI,YAAY,EAAE,IAAI;oBAClB,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/E,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACvE;aACF,CAAC;QACR,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;QAE7C,OAAO;YACL,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC;YACvB,MAAM,EAAE,MAAM;YACd,GAAG,OAAO;YACV,QAAQ;SACT,CAAC;IACJ,CAAC,CAAC;IAEF,MAAM,IAAI,GAAiC,EAAE,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAEtE,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC;IAChE,MAAM,QAAQ,GAAa;QACzB,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,QAAQ,EAAE,OAAO,CAAC,QAAQ;QAC1B,GAAG,CAAC,OAAO,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC;YAC5E,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC;QACjC,MAAM,EAAE,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,EAAE;QACpC,GAAG,CAAC,OAAO,CAAC,SAAS;YACnB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,KAAK,EAAE;oBACL,MAAM,EAAE;wBACN;4BACE,IAAI,EAAE,WAAW;4BACjB,OAAO,EACL,qIAAqI;4BACvI,MAAM,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM;yBACzD;qBACF;iBACF;aACF,CAAC;QACN,IAAI;KACL,CAAC;IAEF,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACpC,CAAC,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@goodbones/core",
-  "version": "0.1.0-beta.3",
+  "version": "0.1.0-beta.4",
   "type": "module",
   "license": "MIT",
   "description": "Architecture policy as one manifest of your repository, language-agnostic: the manifest schema, the evaluators for imports, exports, members, surface, structure and the import graph, the ports a language pack implements, and the loader that turns a manifest into a policy every rule of which has proven it can fire.",

package/src/core/graph.ts

@@ -215,6 +215,18 @@ const stronglyConnected = (
   return components;
 };
 
+// Every cycle in the graph, each as its sorted member set. What `infer` asks
+// before it writes a no-cycles rule: a rule the tree fails on day one is a
+// baseline entry, not a description of the tree.
+export const cyclesIn = (graph: Graph): ReadonlyArray<ReadonlyArray<string>> =>
+  stronglyConnected(graph.files, graph).filter((component) => {
+    const [first] = component;
+    return (
+      first !== undefined &&
+      (component.length > 1 || (graph.edges.get(first) ?? []).includes(first))
+    );
+  });
+
 const evaluateCycles = (rule: CompiledGraphCycleRule, graph: Graph): ReadonlyArray<Violation> => {
   const nodes = graph.files.filter((file) => inScope(rule, file));
   const violations: Array<Violation> = [];

package/src/index.ts

@@ -37,6 +37,7 @@ export {
 export {
   type CompiledGraph,
   compileGraphRules,
+  cyclesIn,
   EMPTY_GRAPH_RULES,
   evaluateGraph,
   type Graph,
@@ -134,7 +135,13 @@ export {
   type IncludeReader,
   type SourceDocument,
 } from "./infrastructure/manifest-include.js";
-export { listSourceFiles, type WalkedLanguage } from "./infrastructure/walk.js";
+export {
+  listPackageRoots,
+  listSourceFiles,
+  type PackagedLanguage,
+  type PackageRoot,
+  type WalkedLanguage,
+} from "./infrastructure/walk.js";
 export { type LoadedPolicy, loadPolicy, type LoadPolicyInput } from "./load/policy.js";
 export { type LoweredRules, lowerManifest, type ProbeLanguage } from "./manifest/compile.js";
 export {
@@ -145,6 +152,18 @@ export {
   originOf,
   type Substitution,
 } from "./manifest/expand.js";
+export {
+  type Candidate,
+  candidatesOf,
+  type Generalization,
+  type InferInput,
+  inferManifest,
+  type InferOptions,
+  type InferPackage,
+  type Inferred,
+  type InferredTarget,
+  singularOf,
+} from "./manifest/infer.js";
 export {
   MANIFEST_NODE_SCHEMA_ID,
   MANIFEST_SCHEMA_ID,

package/src/infrastructure/walk.ts

@@ -1,4 +1,4 @@
-import { readdirSync, statSync } from "node:fs";
+import { existsSync, readdirSync, statSync } from "node:fs";
 import * as path from "node:path";
 
 import type { Language } from "../ports/language.js";
@@ -52,3 +52,72 @@ export const listSourceFiles = (
   }
   return found.sort();
 };
+
+// What `infer` needs to know about a language beyond the walker's two: what
+// marks a package of it, and where a package keeps its source.
+export type PackagedLanguage = Pick<Language, "packageMarkers" | "sourceRoots">;
+
+export type PackageRoot = {
+  // Repo-relative folder with forward slashes; `""` is the repository itself.
+  readonly root: string;
+  // The package's source folder, repo-relative, when one of the language's
+  // `sourceRoots` exists under it; otherwise `null`, and source sits at the root.
+  readonly source: string | null;
+};
+
+// The packages under (and above) `roots`: every folder holding one of the
+// languages' marker files, the walk roots' own ancestors included, so a walk
+// rooted at `src/` still finds the `package.json` beside it. Sorted by path.
+export const listPackageRoots = (
+  repoRoot: string,
+  roots: ReadonlyArray<string>,
+  languages: ReadonlyArray<PackagedLanguage>,
+): ReadonlyArray<PackageRoot> => {
+  const markers = languages.flatMap((language) => language.packageMarkers);
+  const sourceRoots = languages.flatMap((language) => language.sourceRoots);
+  if (markers.length === 0) return [];
+
+  const isDirectory = (absolute: string): boolean => {
+    try {
+      return statSync(absolute).isDirectory();
+    } catch {
+      return false;
+    }
+  };
+  const relative = (absolute: string): string =>
+    path.relative(repoRoot, absolute).replaceAll(path.sep, "/");
+
+  const found = new Map<string, PackageRoot>();
+  const consider = (absolute: string): void => {
+    const key = relative(absolute);
+    if (found.has(key)) return;
+    if (!markers.some((marker) => existsSync(path.join(absolute, marker)))) return;
+    const source = sourceRoots.find((name) => isDirectory(path.join(absolute, name)));
+    found.set(key, {
+      root: key,
+      source: source === undefined ? null : relative(path.join(absolute, source)),
+    });
+  };
+  const walk = (absolute: string): void => {
+    consider(absolute);
+    for (const entry of readdirSync(absolute)) {
+      if (SKIPPED.has(entry)) continue;
+      const child = path.join(absolute, entry);
+      if (isDirectory(child)) walk(child);
+    }
+  };
+
+  const top = path.resolve(repoRoot);
+  for (const root of roots) {
+    let absolute = path.resolve(repoRoot, root);
+    if (!isDirectory(absolute)) absolute = path.dirname(absolute);
+    walk(absolute);
+    // The ancestors, up to the repository: a package is as often above the
+    // walk root as inside it.
+    for (let above = absolute; above.startsWith(top); above = path.dirname(above)) {
+      consider(above);
+      if (above === top) break;
+    }
+  }
+  return [...found.values()].sort((a, b) => a.root.localeCompare(b.root));
+};