Function builtins_by_name 

fn builtins_by_name() -> &'static HashMap<String, &'static IndexEntry>

The built-in tables hashed by upper-cased display name, built once on first use — the name lives on the constructed index, not on the table row, so this pays one construction per entry once per process rather than one per entry on every lookup (a miss used to construct the whole registry). Insertion order follows the table scan order, first entry winning a duplicate name — identical resolution to the linear scan it replaces.