- Unify some subroutines for capture/refile/extract/insert/find
- Upstream some stuff to Org
org-node-narrow-to-drawer-p- Patch
org-end-of-meta-datato support file level (without FULL then likeorg-node-goto-new-drawer-site, with FULL then likeorg-node-full-end-of-meta-data)
- Upstream applicable parts of
org-node-roam-accelerator-modeto Org-roam
- #172
- #171
- #168
- #161
- #151
- #143
- #130
- #62
- A workflow to allow untitled nodes
- [X] Create node without needing to type a title
- [X]
org-node-grep - [ ] Let
org-node-grepcreate new nodes - [ ] (Rewrite
org-node-grepso it does not need Consult) - [ ] Subroutine for identifying a node by a grep result, which could be used to insert/extract/capture/refile while only ever completing against grep results
- [ ] See that issue about untitled notes #112
Figure out the helper commands you’d want for embedding human-generated IDs in headings/titles.
- Let
org-node-grepobeyorg-node-filter-fn - Let user preview the filename that will be created. (Currently, when option
org-node-file-directory-askis t, it just asks you for a directory, which is weirdly restrictive.) - Make a command akin to
org-node-lint-all-files, but that just runsorg-element-parse-bufferwithorg-element--cache-diagnosticson, then prints any issues.- Or rewrite org-mem so it uses
org-element-parse-bufferfrom the start. See https://github.com/meedstrom/org-mem/issues/ XXX
- Or rewrite org-mem so it uses
- Help Embark and Marginalia integrate more deeply with
org-node-read-candidate. See package consult-org-roam. - Refactor
org-node-rename-asset-and-rewrite-linksfor easier use, it’s sub-par - Write a glossary, to define precise jargon e.g. what is a “ref” vs “reflink”
org-node-seq-dispatch: Free up keys “j”, “n”, “p”, “c”- More
org-node-seq-defswrappers:- A wrapper that looks at a given “master node” that defines a seq: links in the body text become the seq.
- A wrapper that defines a seq as simply the files in a given subdirectory.
- Count some ref variants as the same ref
If a roam-ref exists like
//www.website.com, allow counting a link//www.website.com?key=val&key2=val2#hashas a reflink to the same, unless the latter has a roam-ref of its own.Would prolly be a fairly expensive operation. After building tables ref<>id and dest<>links, run thru every dest and check if an existing ref is a prefix of it, then simply nconc the value with the value for the corresponding dest. But having to check for other dests that may also be a prefix is where it would get expensive… O(n^2) I guess.
Hm… Sort all dests alphabetically. All near-matches will be very close to each other, and indeed an alphabetic sort even results in a sort-by-length within each possible “group”. So just run down progressively shorter prefixes until the length goes up again, then we know we’re in another group. Rough idea, but O(n^2) looks beatable.