this code very faster

[mProjectsCode]

🦀 (feel free to change the name of this PR)

[mProjectsCode]

TODO list:

• [x] make edge builder build the rust data directly
• [x] relevant settings get passed to rust
• [x] implement all features for mermaid code blocks
• [x] implement all features for tree view
• [x] fix all of the other views
• [ ] get incremental graph rebuilds on vault events working => Separate PR
• [x] re-implement the transitive rule preview in the settings
• [x] fix the thread command
  • The target note needs to be created first, before trying to add the new edge to the graph
• [ ] update the settings types so that the old types can be removed
  • e.g. implied_rule.chain uses a BCAttribute[], but only ever needs to be a string[] in practice
• [ ] remove old commented out code

[mProjectsCode]

Some preliminary performance metrics. (Take with a grain of salt, as with all benchmarks.) Tested with 2564 notes in a tree shape. Each note has 1 to 3 explicit up frontmatter links. The tree is cut off at depth 10. Transitive rules:

[up] <- down
[down] <- up
[same] <- same
[uncle] <- nephew
[nephew] <- uncle
[up, down] -> same
[up, same] -> uncle

This fork:

• Initial Graph: ~4ms
• Implied Edges: ~2.5ms
• Total: ~18ms

Current Master (4.2.27) after running a few times to get JIT advantages:

• Implied Edges: ~70ms
• Total: ~85ms

This fork is about 4x faster regarding total time and about 25x faster in building implied edges.

[mProjectsCode]

There might be some strangeness with sorting, as bind gen frees arrays of rust objects when passed to rust. Since there is no way to pass a reference to an array, the sorting code returns an array that has to override the array passed in.

[mProjectsCode]

Yep, it seems i was quite tired when I made those last few commits and missed a lot of places 😅