Show More
| @@ -1,9 +1,6 b'' | |||
|
|
1 | 1 | == New Features == |
|
|
2 | 2 | |
|
|
3 | 3 | |
|
|
4 | * The memory footprint per changeset and per file during pull/unbundle | |
|
|
5 | operations has been significantly reduced. | |
|
|
6 | ||
|
|
7 | 4 | |
|
|
8 | 5 | == New Experimental Features == |
|
|
9 | 6 | |
| @@ -20,15 +17,3 b'' | |||
|
|
20 | 17 | == Internal API Changes == |
|
|
21 | 18 | |
|
|
22 | 19 | |
|
|
23 | * `phases.registernew` now takes a set of revisions instead of a list | |
|
|
24 | of nodes. `phases.advanceboundary` takes an optional set of revisions | |
|
|
25 | in addition to the list of nodes. The corresponeding members of the | |
|
|
26 | `phasecache` class follow this change. | |
|
|
27 | ||
|
|
28 | * The `addgroup` member of `revlog` classes no longer keeps a list of | |
|
|
29 | all found nodes. It now returns True iff a node was found in the group. | |
|
|
30 | An optional callback for duplicated nodes can be used by callers to keep | |
|
|
31 | track of all nodes themselve. | |
|
|
32 | ||
|
|
33 | * The `_chaininfocache` of `revlog` classes has been changed from a dict | |
|
|
34 | to a LRU cache. | |
General Comments 0
You need to be logged in to leave comments.
Login now