@skokenes I think this fixes your issue #367. Could you give it a try please?
In a history with a lot of branching and merging, the slow path algorithm in OpSet.getMissingChanges would traverse a number of paths that grows exponentially in the length of the history. Ooops! Should have been O(n), was actually O(2^n). No wonder it would grind to a halt.
@skokenes I think this fixes your issue #367. Could you give it a try please?
In a history with a lot of branching and merging, the slow path algorithm in
OpSet.getMissingChanges
would traverse a number of paths that grows exponentially in the length of the history. Ooops! Should have been O(n), was actually O(2^n). No wonder it would grind to a halt.