3
1. Find common ancestor [O(a)] **O(b)**
4
2. Emit bundle [O(a)] **O(b) O(h)**
9
2. emit changes for files
11
1. find changed files [O(c)] **O(f)**
12
2. emit file metadata O(d)
13
3. emit diff [O(e * e) * O(f) + O(h)] **O(i)**
16
3. **emit overal diff (or maybe do interdiff) O(e * e) * O(f)**
18
:a: nodes in revision graph
19
:b: number of descendants of common ancestor
20
:c: number of files in the tree
21
:d: length of metadata
23
:f: number of modified files
25
:h: nodes in knit graph of modified files
26
:i: length of stored diff
30
- Improved common ancestor algorithm
31
- Access to partial revision graph proportional to relevant revisions
32
- Access to changed files proportional to number of change files and
34
- Use knit deltas without recomputing
35
- Access to knit deltas in O(1) time
36
- Access to snapshots in O(1) amortized time
37
- All snapshots must have knit deltas