equal
deleted
inserted
replaced
50 exchange. While the algorithm we use can scale well for large repositories, the |
50 exchange. While the algorithm we use can scale well for large repositories, the |
51 naive python implementation that you are using is not very efficient, the |
51 naive python implementation that you are using is not very efficient, the |
52 storage backend for that cache neither. |
52 storage backend for that cache neither. |
53 |
53 |
54 This computation will finish in a finite amount of time, even for repositories |
54 This computation will finish in a finite amount of time, even for repositories |
55 with millions of revision and many merges. However it might take multiple tens |
55 with millions of revisions and many merges. However it might take multiple tens |
56 of minutes to complete in such case. |
56 of minutes to complete in such case. |
57 |
57 |
58 In the future, better implementation of the algorithm in a more appropriate |
58 In the future, better implementation of the algorithm in a more appropriate |
59 language than Python will make it much faster. This data should also get |
59 language than Python will make it much faster. This data should also get |
60 exchanged between server and clients removing recomputation needs. |
60 exchanged between server and clients removing recomputation needs. |