Yuan Fu
They must have changed in Emacs 28, I changed it to be Emacs 27-compatible.
I guess I shouldn't just copy code from `describe-function` and expect it to work. I changed it to native code. It seems to work with counsel.
Ah, sorry, I forgot to reply. Last time I checked, it works on vanilla Emacs 27. Could you try test it with `emacs -q`? You want to pull the latest...
Welcome to GNU Emacs, bro.
> It's not easy to implement my original idea btw: AFAIU I have to create copies of `buffer-undo-list', `undo-equiv-table' and `pending-undo-list' with markers treated, but leaving shared structures intact (overarching!)....
Not super safe. If you generate too much undo records, and undo list exceeds undo limit, Emacs will delete the earliest undo records, then the index would be shifted and...
Should be fine, someone did some experiments and it seems vundo works fine with larger undo history: https://github.com/casouri/vundo/issues/67.
Ah, ok. If the slowdown is at the start when vundo generates the tree, then I think vundo is to blame. The size of the file doesn't make vundo faster...
Thanks very much. The problem is, I couldn't tell what's taking the majority of time... `vundo--refresh-buffer` is a pretty high-up function and it contains a lot of things that might...
If someone implements one that works, I'lm more than happy to make it an option :-)