Function compile_dict

scripts/compile_to_inline_config.py:111–141

(dict_def: Dict[str, Any], dict_dir: Path)

def compile_dict(dict_def: Dict[str, Any], dict_dir: Path) -> Dict[str, Any]:
    if dict_def["type"] == "group":
        compiled_children = [compile_dict(sub_def, dict_dir) for sub_def in dict_def["dicts"]]
        match_policy = dict_def.get("match_policy", "short_circuit")

        if match_policy == "union":
            # Union semantics: longest prefix wins regardless of child order.
            # A flat merged inline dict has the same semantics because LeafMatcher
            # always returns the longest match; first-occurrence wins for same key.
            # Nested union groups are also absorbed since union(union(...)) = union(...).
            if all(is_union_mergeable(child) for child in compiled_children):
                merged: Dict[str, str] = {}
                for child in compiled_children:
                    collect_union_entries(child, merged)
                return {"type": "inline", "entries": sort_dict_keys(merged)}

        result: Dict[str, Any] = {"type": "group"}
        if "match_policy" in dict_def:
            result["match_policy"] = dict_def["match_policy"]
        result["dicts"] = compiled_children
        return result

    if dict_def["type"] == "inline":
        entries = dict_def["entries"]
    else:
        entries = inline_entries_for_file_dict(dict_def, dict_dir)

    return {
        "type": "inline",
        "entries": sort_dict_keys(entries),
    }

def sort_dict_keys(d: Dict[str, str]) -> Dict[str, str]:
    return {k: d[k] for k in sorted(d.keys())}