{"ast_node_type":"other","tokens":[{"end":76,"kind":"keyword","start":0,"text":"//"}]}
        // fast enough and avoids the need to implement Hash for Definition.
        // We expect a very small number of cache entries (generally 1), so a linear scan should be
        for (d, refs) in &self.usages {