summaryrefslogtreecommitdiff
path: root/out/_next/static/chunks/webpack-9c7513cc478a82b87a1b.js
diff options
context:
space:
mode:
authorBrian Lester <[email protected]>2021-08-03 22:08:44 -0400
committerBrian Lester <[email protected]>2021-08-03 22:32:28 -0400
commit14b18cebe0f0055a611556011a70686dcc755334 (patch)
treecda85be3e8c37f4f0aa271d5ee92506af6ae623c /out/_next/static/chunks/webpack-9c7513cc478a82b87a1b.js
parent6f555f6ea6233875fd7e9a7e9041ab7c2df44664 (diff)
Use `org-roam-bibtex` to find titles for node-less cite nodes.
This change uses `org-roam-bibtex` (if it and it's dependencies are installed) to look up the cite links that do not have an associated node in the bibliography. This feature also needs to be enabled by setting `org-roam-ui-find-ref-title` variable to `'t`. This uses `fboundp` and `boundp` to check if `org-roam-bibtex` is installed, this are the same kinds of checks that projectile uses to decide between backends like helm or ivy, so it seems like a reason approach. I currently have only tested on my personal graph which only has around 10 node-less cite links, so I don't know how drastically this would slow things down. Given that bibliography entries are not updated often it think it would be safe to cache the titles based on the ref, then only the initial load of the graph would be slow. Later, adding a cite link to a new entry would get looked up, but that wouldn't be a huge cost. We could either roll our own with a hash table or bring in a [memoization library](https://github.com/skeeto/emacs-memoize)
Diffstat (limited to 'out/_next/static/chunks/webpack-9c7513cc478a82b87a1b.js')
0 files changed, 0 insertions, 0 deletions