-
Currently patch sizes are often 10s of kb. Which is plenty small for many applications. However we're using a binary diffing algorithm which knows nothing about what it's diffing and could probably …
-
**Epics:** https://github.com/elastic/security-team/issues/1974 (internal), https://github.com/elastic/kibana/issues/174168
## Summary
Implement an algorithm for diffing and merging changes in `…
-
**Epics:** https://github.com/elastic/security-team/issues/1974 (internal), https://github.com/elastic/kibana/issues/174168
## Summary
Implement an algorithm for diffing and merging changes in a…
-
# Open
- [ ] Strange numbering for deleted section headings
- [ ] Completely deleted tables lose thei…
-
- could we somehow tell elevenlabs certain `.`s are not periods? (maybe we replace the `.` by `dot` or something). Such `.`s can maybe be identified if the `.` does not have any whitespace on either s…
-
Currently, there is neither an efficient tree diffing algorithm nor any dep tracking. Dep tracking may remove need for fast diffing.
TODO:
- [x] props work w new system
- [x] track which part o…
-
I love `neovim` and have been using it since 2017 (just prior to version 0.2). The features introduced in the latest 0.5 release (lua, LSP, treesitter etc.) make it even more awesome.
I'd like to …
-
`bsdiff` format uses two somewhat unrelated concepts that fit many, but not all use cases: **diffing algorithm** and **patch storage format**.
There are multiple diffing algorithms which could be …
-
Diffing arrays is particularly inefficient when changes trigger the full LCS algorithm. Implementing [Myers' algorithm](http://xmailserver.org/diff2.pdf) should be a significant speed-up.
(Leaving th…
-
### Current versus expected behaviour
Consider the following code:
```
const a1 = new ShapeV4();
a1.position(20, 20);
graph.addCells([a1]);
a1.attr({ title: { textWrap: { text: "foo" } } }…