Timeline for Is there an efficient way to fontify matches of thousands of different strings in a buffer?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 26 at 13:02 | comment | added | John Kitchin |
regexp-opt also leads to Invalid regexp: "Regular expression too big" in my case. I haven't had any luck defining regexps this way, and use the "inverse" lookup approach described above because it does scale. A sequential lookup is a good idea though, I will give that some thought. Thanks.
|
|
| Feb 26 at 4:29 | history | edited | phils | CC BY-SA 4.0 |
added 585 characters in body
|
| Feb 26 at 2:58 | history | answered | phils | CC BY-SA 4.0 |