Instead we should maintain a map of { frame id -> set of trace elements for that frame } as we add and remove traces. This would bring us down to an O(1) search for matching frames.

Now this is just lovely.

Are we sure that the memory overhead is worth it? Is searching janky as it is now?

(In reply to Panos Astithas [:past] from comment #2) > Are we sure that the memory overhead is worth it? Is searching janky as it > is now? The only time I've experienced jank when searching is when deleting a search term in one stroke (Opt + Backspace to delete a whole word on OSX) and having all logs be made visible again at once. Unrelated to this, as this is about the hover-frame-matching stuff. I haven't experienced any jank yet.