Hi pmeunier, very nice article I quite enjoyed it.
> The complexity of apply is in O(p c log∣H|), where p is the size of the change, c is the size of the largest conflict in which p is involved, and H is the number of edits made since the start of the repository.
Is it possibly to lazy fetch the repository so you can keep H as low as possible? Like only look at H that are in conflict or something?
> Is it possibly to lazy fetch the repository so you can keep H as low as possible? Like only look at H that are in conflict or something?
Something like that is announced at the end of the post ;-) It will hopefully be possible within a few days. The design is mostly done (at least for the basic feature), but my solution changes the implementation quite a bit, so I would expect temporary breakages (we're still in alpha, after all!).
