this code very faster

[mProjectsCode]

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

[mProjectsCode]

TODO list:

• make edge builder build the rust data directly
• relevant settings get passed to rust
• implement all features for mermaid code blocks
• implement all features for tree view
• fix all of the other views
• get incremental graph rebuilds on vault events working => Separate PR
• re-implement the transitive rule preview in the settings
• 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 => Separate PR
  • e.g. implied_rule.chain uses a BCAttribute[], but only ever needs to be a string[] in practice
• remove old commented out code
• revive the markmap code block
• improve graph updates via debouncing and aggregating into one batch update => Separate PR

[SkepticMystic]

Looking good so far. I'm gonna try review frequently to keep the diff size small

[SkepticMystic]

Nice, continues to get closer :)

[SkepticMystic]

Nice, this is mcuh easier to understand now

[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.

[SkepticMystic]

Nice, looking good

[mProjectsCode]

Did some optimizations:

1. removed dyn in hot paths and replaced it with enums
2. replaced String with Rc<str> since we have lots of the same small strings, we can use Rc, which only clones the pointer and not the string.

[mProjectsCode]

I limited the tree view and trail view to depth 5 for now. The graph engine can easily handle more, but the rendering is too slow. There should be an indicator that a cut-off happened though.

[mProjectsCode]

The total graph rebuilding time is now at ~15ms for a tree structure vault with 2.5k files.

[mProjectsCode]

Some more progress:

1. removed a lot of potential crash points in the Rust part, now they will throw a JS error
2. updated to svelte 5
3. some further minor optimizations