(hidden) BislYexyN

words:	0 + 245 = 245
last update:

Linked Mentions (2 in 1 page)

January 4th, 2022 (2)
- ofc there's a lot of [[(hidden) BislYexyN]]s to be done, it's currently fairly naive. and, they seem more doable / easier than the side effect detection:
  - ((RpqCi8rWX))
- this would likely require [[(hidden) BislYexyN]]s - detecting if changes have side effects that impact not only the edited block, but the whole page, or even the whole graph / parts of it
  - (hidden) AV7J4zqkD:: linking to a page - both pages need updating now
    - and if it's a meta page / has powers, then extra works to potentially any pages in the graph.
    - i.e. annoying stuff!
  - idk, maybe if we manage to keep the stuff fast, like it is now [1], then going thru the whole graph shouldn't be as bad?
    - e.g. we could have a queue of incoming events, and we'd only do 1 at a time, and if a new one comes in too fast, we'd wait for the currently one to complete, and in the meantime if more come in, we'd discard all the new ones except the newest, and then could go again.
    - [1] it takes ~5 seconds? to go from a `notes-private/graph.json` into a `notes-public/*.html`
      - and probably ~20 seconds when i introduce the stuff from the [[(hidden) nicjeov_l]] branch which is currently WIP.
        
        ((yxHMW9jlb))
        
        ofc there's a lot of [[(hidden) BislYexyN]]s to be done, it's currently fairly naive. and, they seem more doable / easier than the side effect detection:
        
        ((RpqCi8rWX))
      - both assume 1. my size of the graph (1K pages, 8K words)
        
        ((FI6sCM5cI))
        
        ((xUKym_BXn))
        
        ((gf1mkreMz))
        
        ((spuKqLoxE))
        
        ((m1Fk_dVUP))