{"ast_node_type":"other","tokens":[{"end":99,"kind":"keyword","start":0,"text":"//"}]}
        // We expect a very small number of cache entries (generally 1), so a linear scan should be
    fn find(&mut self, definition: &Definition) -> Option<&UsageSearchResult> {
        // fast enough and avoids the need to implement Hash for Definition.