Open gohabereg opened 9 months ago
Currently inline fragments are merged in case two neighbouring fragments:
How it should work ideally:
Naive solution would be O(n^2), we should think of more efficient solution
Currently inline fragments are merged in case two neighbouring fragments:
How it should work ideally:
Naive solution would be O(n^2), we should think of more efficient solution