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